![](/images/graphics-bg.png)
A Conjugate Gradient Method for Unconstrained Optimization Problems
Author
Source
International Journal of Mathematics and Mathematical Sciences
Issue
Vol. 2009, Issue 2009 (31 Dec. 2009), pp.1-14, 14 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2009-11-30
Country of Publication
Egypt
No. of Pages
14
Main Subjects
Abstract EN
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.
Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-Powell (WWP) line search rule is established for nonconvex function.
Numerical results show that this method is better than the FR method and the WYL method.
American Psychological Association (APA)
Yuan, Gonglin. 2009. A Conjugate Gradient Method for Unconstrained Optimization Problems. International Journal of Mathematics and Mathematical Sciences،Vol. 2009, no. 2009, pp.1-14.
https://search.emarefa.net/detail/BIM-464052
Modern Language Association (MLA)
Yuan, Gonglin. A Conjugate Gradient Method for Unconstrained Optimization Problems. International Journal of Mathematics and Mathematical Sciences No. 2009 (2009), pp.1-14.
https://search.emarefa.net/detail/BIM-464052
American Medical Association (AMA)
Yuan, Gonglin. A Conjugate Gradient Method for Unconstrained Optimization Problems. International Journal of Mathematics and Mathematical Sciences. 2009. Vol. 2009, no. 2009, pp.1-14.
https://search.emarefa.net/detail/BIM-464052
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-464052