A Conjugate Gradient Method for Unconstrained Optimization Problems

Gonglin Yuan

International Journal of Mathematics and Mathematical Sciences, 2009, vol. 2009, 1-14

Abstract:

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 . 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.

Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2009/329623.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2009/329623.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:329623

DOI: 10.1155/2009/329623

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().