New inexact line search method for unconstrained optimization

Journal of Optimization Theory and Applications

Volumn 127, Issue 2, 2005, Pages 425-446

  Shi, Z J ^a,b   Shen, J ^c  

^a QUFU NORMAL UNIVERSITY   (China)

^b INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

^c UNIVERSITY OF MICHIGAN DEARBORN   (United States)

Author keywords

Convergence rate; Global convergence; Inexact line search; Unconstrained optimization

Indexed keywords

NUMERICAL METHODS;

ARMIJO LINE SEARCHES; CONVERGENCE RATES; DESCENT METHOD; GLOBAL CONVER-GENCE; INEXACT LINE SEARCHES; LINE-SEARCH METHODS; SEARCH PROCEDURES; STEP SIZE; UNCONSTRAINED OPTIMIZATION;

OPTIMIZATION;

EID: 28244454161     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-6553-6     Document Type: Article

References (22)

1. DENNIS, J. E., and SCHNABLE, R. B., Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Ennglewood Cliffs, New Jersey, 1983.
2. NOCEDAL, J., Theory of Algorithms for Unconstrained Optimization, Acta Numerica, Vol. 1, pp. 199-242, 1992.
3. POWELL, M. J. D., Direct Search Algorithms for Optimization Calculations, Acta Numerica, Vol. 7, pp. 287-336, 1998.
4. WOLFE, P., Convergence Conditions for Ascent Methods, SIAM Review, Vol. 11, pp. 226-235, 1969.
5. WOLFE, P., Convergence Conditions for Ascent Methods, II: Some Corrections, SIAM Review, Vol. 13, pp. 185-188, 1971.
6. SHI, J. Z., Convergence of Line-Search Methods for Unconstrained Optimization, Applied Mathematics and Computation, Vol. 157, pp. 393-405, 2004.
7. COHEN, A. I., Stepsize Analysis for Descent Methods, Journal of Optimizaiton Theory and Applications, Vol. 33, pp. 187-205, 1981.
8. YUAN, Y., Numerical Methods for Nonlinear Programming, Shanghai Scientific and Technical Publishers, 1993.
9. TODD, M. J., On Convergence Properties of Algorithms for Unconstrained Minimization, IMA Journal of Numerical Analysis, Vol. 9, pp. 435-441, 1989.
10. SHI, Z. J., A Supermemory Gradient Method for Unconstrained Optimization Problems, Chinese Journal of Engineering Mathematics, Vol. 17, pp. 99-104, 2000 (in Chinese).
11. WEI, Z., QI, L., and JIANG, H., Some Convergence Properties of Descent Methods, Journal of Optimization Theory and Applications, Vol. 95, pp. 177-188, 1997.
12. VRAHATIS, M. N., ANDROULAKIS, G. S., and MANOUSSAKIS, G. E., A New Unconstrained Optimization Method for Imprecise Function and Gradient Values, Journal of Mathematical Analysis and Applications, Vol. 197, pp. 586-607, 1996.
13. GRIPPO, L., LAMPARIELLO, F., and LUCIDI, S., A Class of Nonmonotone Stability Methods in Unconstrained Optimization, Numerische Mathematik, Vol. 62, pp. 779-805, 1991.
14. DAI, Y. H., On the Nonmonotone Line Search, Journal of Optimization Theory and Applications, Vol. 112, pp. 315-330, 2002.
15. SUN, W. Y., HAN, J. Y., and SUN, J., Global Convergence of Nonmonotone Descent Methods for Unconstrained Optimization Problems, Journal of Computational and Applied Mathematics, Vol. 146, pp. 89-98, 2002.
16. BARZILAI, J., and BORWEIN, J. M., Two-Point Stepsize Gradient Methods, IMA Journal of Numerical Analysis, Vol. 8, pp. 141-148, 1988.
17. DAI, Y. H., and LIAO, L. Z., R-Linear Convergence of the Barzilai and Borwein Gradient Method, IMA Journal of Numerical Analysis, Vol. 22, pp. 1-10, 2002.
18. RAYDAN, M., The Barzilai and Borwein Method for the Large-Scale Unconstrained Minimization Problem, SIAM Journal on Optimization, Vol. 7, pp. 26-33, 1997.
19. RAYDAN, M., On the Barzilai-Borwein Gradient Choice of Steplength for the Gradient Method, IMA Journal of Numerical Analysis, Vol. 13, pp. 321-326, 1993.
20. MORÉ, J. J., GARBOW, B. S., and HILLSTRON, K. E., Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software, Vol. 7, pp. 17-41, 1981.
21. NOCEDAL, J., and WRIGHT, S. J., Numerical Optimization, Springer Verlag, New York, NY, 1999.
22. POLAK, E., Optimization: Algorithms and Consistent Approximations, Springer Verlag, New York, NY, 1997.