Global Convergence of a Spectral Conjugate Gradient Method for Unconstrained Optimization
A new nonlinear spectral conjugate descent method for solving unconstrained optimization problems is proposed on the basis of the CD method and the spectral conjugate gradient method. For any line search, the new method satisfies the sufficient descent condition gkTdk<−∥gk∥2. Moreover, we prove t...
Main Authors: | Jinkui Liu, Youyi Jiang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2012/758287 |
Similar Items
-
A Globally Convergence Spectral Conjugate Gradient Method for Solving Unconstrained Optimization Problems
by: Basim Hassan
Published: (2013-12-01) -
The Global Convergence of a New Mixed Conjugate Gradient Method for Unconstrained Optimization
by: Yang Yueting, et al.
Published: (2012-01-01) -
Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
by: Liu Jinkui, et al.
Published: (2011-01-01) -
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
by: Shengwei Yao, et al.
Published: (2013-01-01) -
Application of spectral conjugate gradient methods for solving unconstrained optimization problems
by: Sulaiman Mohammed Ibrahim, et al.
Published: (2020-06-01)