A class of nonmonotone conjugate gradient methods for unconstrained optimization

Journal of Optimization Theory and Applications

Volumn 101, Issue 1, 1999, Pages 127-140

  Liu, G H ^a   Jing, L L ^b   Han, L X ^c   Han, D ^d  

^a Northwestern University   (United States)

^b BEIJING FORESTRY UNIVERSITY   (China)

^c UNIVERSITY OF CONNECTICUT   (United States)

^d CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Global convergence; Nonmonotone conjugate gradient method; Nonmonotone line search; Unconstrained optimization

Indexed keywords

NUMERICAL METHODS; OPTIMIZATION;

CONJUGATE-GRADIENT METHOD; CONVEX OBJECTIVES; GLOBAL CONVER-GENCE; GLOBALLY CONVERGENT; NONMONOTONE; NONMONOTONE CONJUGATE GRADIENT METHOD; NONMONOTONE LINE SEARCH; OBJECTIVE FUNCTIONS; UNCONSTRAINED OPTIMIZATION; UNCONSTRAINED OPTIMIZATION PROBLEMS;

CONJUGATE GRADIENT METHOD;

EID: 0033247740     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021723128049     Document Type: Article

References (14)

1. 1. POLAK, E., and RIBIÈRE, G., Note sur la Convergence de Méthodes des Directions Conjuguées, Revue Francaise d'Informatique et Recherche Opérationelle, Vol. 16, pp. 35-43, 1969.
2. 2. FLETCHER, R., and REEVES, C. M., Function Minimization by Conjugate Gradients, Computer Journal, Vol. 7, pp. 149-154, 1964.
3. 3. POWELL, M. J. D., Nonconvex Minimization Calculations and the Conjugate Gradient Method, Lecture Notes in Mathematics, Springer Verlag, Berlin, Germany, Vol. 1066, pp. 122-141, 1984.
4. 4. TOUATI-AHMED, D., and STOREY, C., Efficient Hybrid Conjugate Gradient Techniques, Journal of Optimization Theory and Applications, Vol. 64, pp. 379-397, 1990.
5. 5. POWELL, M. J. D., Restart Procedures for the Conjugate Gradient Method, Mathematical Programming, Vol. 12, pp. 241-254, 1977.
6. 6. GILBERT, J. C., and NOCEDAL, J., Global Convergence Properties of Conjugate Gradient Methods for Optimization, SIAM Journal on Optimization, Vol. 2, pp. 21-42, 1992.
7. 7. AL-BAALI, M., Descent Property and Global Convergence of the Fletcher-Reeves Method with Inexact Line Search, IMA Journal of Numerical Analysis, Vol. 5, pp. 121-124, 1985.
8. 8. ZOUTENDIJK, G., Nonlinear Programming: Computational Methods, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland, Amsterdam, Holland, pp. 37-86, 1970.
9. 9. LUCIDI, S., and ROMA, M., Nonmonotone Conjugate Gradient Methods for Optimization, System Modeling and Optimization, Edited by J. Henry and J. D. Yvon, Lecture Notes on Control and Information Sciences, Springer Verlag, Berlin, Germany, 1995.
10. 10. TOINT, P. L., An Assessment of Nonmonotone Line Search Techniques for Unconstrained Optimization, SIAM Journal on Scientific Computing, Vol. 17, pp. 725-739, 1996.
11. 11. GRIPPO, L., LAMPARIELLO, F., and LUCIDI, S., A Nonmonotone Line Search Technique for Newton's Method, SIAM Journal on Numerical Analysis, Vol. 23, pp. 707-716, 1986.
12. 12. LIU, G. H., HAN, J. Y., and SUN, D. F., Global Convergence of the BGFS Algorithm with Nonmonotone Line Search, Optimization, Vol. 34, pp. 147-159, 1995.
13. 13. NOCEDAL, J., Theory of Algorithms for Unconstrained Optimization, Acta Numerica, Vol. 1, pp. 199-242, 1992.
14. 14. POWELL, M. J. D., Some Properties of the Variable Metric Method, Numerical Methods for Nonlinear Optimization, Edited by F. A. Lootsma, Academic Press, London, England, pp. 1-17, 1972.