![](/images/graphics-bg.png)
A Simple Sufficient Descent Method for Unconstrained Optimization
Joint Authors
Zhou, Dangzhen
Xiao, Yun-Hai
Zhang, Ming-Liang
Source
Mathematical Problems in Engineering
Issue
Vol. 2010, Issue 2010 (31 Dec. 2010), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2010-12-09
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
We develop a sufficient descent method for solving large-scale unconstrained optimization problems.
At each iteration, the search direction is a linear combination of the gradient at the current and the previous steps.
An attractive property of this method is that the generated directions are always descent.
Under some appropriate conditions, we show that the proposed method converges globally.
Numerical experiments on some unconstrained minimization problems from CUTEr library are reported, which illustrate that the proposed method is promising.
American Psychological Association (APA)
Zhang, Ming-Liang& Xiao, Yun-Hai& Zhou, Dangzhen. 2010. A Simple Sufficient Descent Method for Unconstrained Optimization. Mathematical Problems in Engineering،Vol. 2010, no. 2010, pp.1-9.
https://search.emarefa.net/detail/BIM-490371
Modern Language Association (MLA)
Zhang, Ming-Liang…[et al.]. A Simple Sufficient Descent Method for Unconstrained Optimization. Mathematical Problems in Engineering No. 2010 (2010), pp.1-9.
https://search.emarefa.net/detail/BIM-490371
American Medical Association (AMA)
Zhang, Ming-Liang& Xiao, Yun-Hai& Zhou, Dangzhen. A Simple Sufficient Descent Method for Unconstrained Optimization. Mathematical Problems in Engineering. 2010. Vol. 2010, no. 2010, pp.1-9.
https://search.emarefa.net/detail/BIM-490371
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-490371