A New effected Three-Term Hestenes-Stiefel Conjugate-Gradient Method for Solving Unconstrained Optimization Problems
Article Sidebar
Main Article Content
Abstract
In this paper a new three–term Conjugate Gradient (CG) method is suggested, the derivation of the method based on the descent property and conjugacy condition, the global convergence property is analyzed; numerical results indicate that the new proposed CG-method is well compared against other similar CG-methods in this field.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
[1] Al-Bayati, A. and Hassan, B. (2006), Some
Theoretical Results for Oren Variable Metric Method.
J. of Kirkuk University, Iraq, 1, 26-31.
[2] Andrei, N. (2013), A simple three-term conjugate
gradient algorithm for unconstrained optimization ,
Journal of Computational and Applied Mathematics,
241, 19–29.
[3] Dennis, J. and More, J. (1977), Quasi-Newton
methods, motivation and theory, SIAM Review, 19,
46-89.
[4] Fletcher, R. (1987), Practical Methods of
Optimization (second edition)", John Wiley and Sons,
New York.
[5] Hestenes, M. and Stiefel, E. (1952) , Method of
conjugate gradients for solving linear systems", J.
Research Nat. Standards , 49, 409-436.
[6] Nazareth, L. (1977), A conjugate direction
algorithm without line search. Journal of
Optimization Theory and Applications, 23, 373-387.
[7] Shanno, D. (1978), Conjugate gradient methods
with inexact searches, Math. of operation Research,
3, 244-256.
[8] Zhang, L. Zhou, Y. (2012), A note on the
convergence properties of the original three-term
Hestenes–Stiefel method, AMO-Advanced Modeling
and Optimization, 14, 159–163.
[9] Zhang, L. Zhou, W. and Li, D. (2007), Some
descent three-term conjugate gradient methods and
their global convergence. Optimization Methods and
Software, 22, 697- 711.
[10] Zhang, J.; Xiao, Y. and Wei, Z. (2009),
Nonlinear conjugate gradient methods with sufficient
descent condition for large-scale unconstrained
optimization. Math. Prog. Eng., Article ID 243290,
16. DOI: 10.1155/2009/243290.
[11] Bongartz, I.; Conn, A.; Gold, N. and Toint, P.
(1995), CUTE: constrained and unconstrained testing
environment, ACM Trans., Math. Software, 21.