The Global Convergence of a New Mixed Conjugate Gradient Method for Unconstrained Optimization
We propose and generalize a new nonlinear conjugate gradient method for unconstrained optimization. The global convergence is proved with the Wolfe line search. Numerical experiments are reported which support the theoretical analyses and show the presented methods outperforming CGDESCENT method.
Saved in:
Main Authors: | Yang Yueting, Cao Mingyuan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/932980 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
by: Shengwei Yao, et al.
Published: (2013-01-01) -
A Conjugate Gradient Method for Unconstrained Optimization Problems
by: Gonglin Yuan
Published: (2009-01-01) -
Several Guaranteed Descent Conjugate Gradient Methods for Unconstrained Optimization
by: San-Yang Liu, et al.
Published: (2014-01-01) -
A Modified Hybrid Conjugate Gradient Method for Unconstrained Optimization
by: Minglei Fang, et al.
Published: (2021-01-01) -
An Efficient Modified AZPRP Conjugate Gradient Method for Large-Scale Unconstrained Optimization Problem
by: Ahmad Alhawarat, et al.
Published: (2021-01-01)