A New Modified Conjugate Gradient for Nonlinear Minimization Problems
The conjugate gradient is a highly effective technique to solve the unconstrained nonlinear minimization problems and it is one of the most well-known methods. It has a lot of applications. For large-scale, unconstrained minimization problems, conjugate gradient techniques are widely applied. In thi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zakho
2022-10-01
|
| Series: | Science Journal of University of Zakho |
| Subjects: | |
| Online Access: | http://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/933 |
| Summary: | The conjugate gradient is a highly effective technique to solve the unconstrained nonlinear minimization problems and it is one of the most well-known methods. It has a lot of applications. For large-scale, unconstrained minimization problems, conjugate gradient techniques are widely applied. In this paper, we will suggest a new parameter of conjugate gradient to solve the nonlinear unconstrained minimization problems, based on parameter of Dai and Liao. We will study the property of the descent ,the property of the sufficient descent and property of the global convergence a new method. We introduce some numerical data to prove the efficacy of the our method.
|
|---|---|
| ISSN: | 2663-628X 2663-6298 |