A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization
Joint Authors
Wu, XiaoPing
Liu, LiYing
Xie, FengJie
Li, YongFei
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-10-26
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed.
The global convergence of the algorithm is established under weak Wolfe line search.
Some numerical experiments show that this new WWPNPRP+ algorithm is competitive to the SWPPRP+ algorithm, the SWPHS+ algorithm, and the WWPDYHS+ algorithm.
American Psychological Association (APA)
Wu, XiaoPing& Liu, LiYing& Xie, FengJie& Li, YongFei. 2015. A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-8.
https://search.emarefa.net/detail/BIM-1073580
Modern Language Association (MLA)
Wu, XiaoPing…[et al.]. A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization. Mathematical Problems in Engineering No. 2015 (2015), pp.1-8.
https://search.emarefa.net/detail/BIM-1073580
American Medical Association (AMA)
Wu, XiaoPing& Liu, LiYing& Xie, FengJie& Li, YongFei. A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-8.
https://search.emarefa.net/detail/BIM-1073580
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1073580
