Convergence of nonmonotone line search method

Journal of Computational and Applied Mathematics

Volumn 193, Issue 2, 2006, Pages 397-412

  Shi, Zhen Jun ^a,b   Shen, Jie ^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; General line search method; Nonmonotone line search; Unconstrained optimization

Indexed keywords

COMPUTATIONAL METHODS; NUMERICAL ANALYSIS; THEOREM PROVING;

GENERAL LINE SEARCH METHOD; NONMONOTONE LINE SEARCH; UNCONSTRAINED OPTIMIZATION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 33646270635     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.06.033     Document Type: Article

References (19)

1. Armijo L. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific J. Math. 16 (1966) 1-3
2. Bongartz I., Conn A.R., Gould N.I.M., and Toint P.L. CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Software 21 (1995) 123-160
3. Dai Y.H. On the nonmonotone line search. J. Optim. Theory Appl. 112 2 (2002) 315-330
4. Goldstein A.A. On steepest descent. SIAM J. Control 3 (1965) 147-151
5. Grippo L., Lampariello F., and Lucidi S. A nonmonotone line search technique for Newton's method. SIAM J. Numer. Anal. 23 (1986) 707-716
6. Grippo L., Lampariello F., and Lucidi S. A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60 (1989) 401-419
7. Grippo L., and Sciandrone M. Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comp. Optim. Appl. 23 (2002) 143-169
8. Hüther B. Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization. Results Math. 41 (2002) 320-333
9. Moré J.J., Garbow B.S., and Hillstrom K.E. Testing unconstrained optimization software. ACM Trans. Math. Software 7 1 (1981) 17-41
10. Nocedal J., and Wright J.S. Numerical Optimization (1999), Springer, New York, Inc.
11. Polak E. Optimization: Algorithms and Consistent Approximations (1997), Springer, New York, Inc.
12. Polyak B.T. Introduction to optimization (1987), Optimization Software, Inc., Publications Division, New York
13. Shi Z.J. Convergence of line search methods for unconstrained optimization. Appl. Math. Comput. 157 (2004) 393-405
14. Shi Z.J., and Shen J. New inexact line search method for unconstrained optimization. J. Optim. Theory Appl. 127 2 (2005) (to appear)
15. Todd M.J. On convergence properties of algorithms for unconstrained minimization. IMA J. Numer. Anal. 9 (1989) 435-441
16. Vrahatis M.N., Androulakis G.S., Lambrinos J.N., and Magoulas G.D. A class of gradient unconstrained minimization algorithms with adaptive stepsize. J. Comput. Appl. Math. 114 (2000) 367-386
17. Wolfe P. Convergence conditions for ascent methods. SIAM Review 11 (1969) 226-235
18. Wolfe P. Convergence condition for ascent methods II: some corrections. SIAM Review 13 (1971) 185-188
19. Zhang H.C., and Hager W.W. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14 (2004) 1043-1056