A Conjugate Gradient Method for Unconstrained Optimization Problems
A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell (SWP) line search rule relaxing the parameter σ<1. Und...
Saved in:
Main Author: | Gonglin Yuan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2009-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2009/329623 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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) -
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
by: Shengwei Yao, et al.
Published: (2013-01-01) -
An Efficient Modified AZPRP Conjugate Gradient Method for Large-Scale Unconstrained Optimization Problem
by: Ahmad Alhawarat, et al.
Published: (2021-01-01) -
Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
by: Sanaz Bojari, et al.
Published: (2024-01-01)