Convergence of line search methods for unconstrained optimization

Applied Mathematics and Computation

Volumn 157, Issue 2, 2004, Pages 393-405

  Shi, Zhen Jun ^a,b  

^a QUFU NORMAL UNIVERSITY   (China)

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

Author keywords

Convergence; Line search method; Unconstrained minimization

Indexed keywords

CONVERGENCE; LINE SEARCH METHOD; UNCONSTRAINED MINIMIZATION;

ALGORITHMS; DIFFERENTIAL EQUATIONS; ITERATIVE METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

MATHEMATICAL MODELS;

EID: 4444343782     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2003.08.058     Document Type: Article

References (27)

1. Armijo L. Minimization of function having Lipschitz continuous first partial derivatives. Pac. J. Math. 16:1966;1-3.
2. Bertsekas D.P., Tsitsiklis J.N. Gradient convergence in gradient methods with errors. SIAM J. Optim. 10(3):2000;627-642.
3. Bertsekas D.P. Constrained Optimization and Lagrange Multiplier Methods. 1982;Academic Press.
4. Cohen A.I. Stepsize analysis for descent methods. J. Optim. Theory Appl. 33(2):1981;187-205.
5. Dussault J.P. Convergence of implementable descent algorithms for unconstrained optimization. J. Optim. Theory Appl. 104(3):2000;749-750.
6. Dai Y.H., Han J., Liu G., Sun D., Yin H., Yuan Y.-X. Convergence properties of nonlinear conjugate gradient methods. SIAM J. Optim. 10(2):1999;345-358.
7. Evtushenko Y.G. Numerical Optimization Techniques. 1985;Optimization Software, New York.
8. Gaviano M., Lera D. On linear convergence of gradient-type minimization algorithms. J. Optim. Theory Appl. 98(2):1998;475-487.
9. Grapsa T.N., Vrahatis M.N. A dimensional-reducing method for unconstrained optimization. J. Comput. Appl. Math. 66:1996;239-253.
10. Hestenes M.R. Conjugate Direction Methods in Optimization. 1980;Springer-Verlag, New York.
11. Liu G.H., Jing L.L., Han L.X., Han D. A class of nonmonotone conjuagte gradient methods for unconstrained optimization. J. Optim. Theory Appl. 101(1):1999;127-140.
12. Lemarechal C., Mifflin R. Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. Math. Program. 24:1982;241-256.
13. Powell M.J.D. Direct search algorithms for optimization calculations. Acta Numer. 7:1998;287-336.
14. Moguerza J.M., Prieto F.J. Combining search directions using gradient flows. Math. Program. 96(3):2003;529-559.
15. Mladineo R.H. Convergence rate of a global optimization algorithm. Math. Program. 54:1992;223-232.
16. Nocedal J., Stephen J.W. Numerical Optimization. 1999;Springer-Verlag, New York.
17. Nocedal J. Theory of algorithms for unconstrained optimization. Acta Numer. 1:1992;199-242.
18. Ortega J.M., Rheinboldt W.C. Iterative Solution Of Nonlinear Equation in Several Variables. 1970;Academic Press.
19. Potra F.A., Shi Y. Efficient line search algorithm for unconstrained optimization. J. Optim. Theory Appl. 85(3):1995;677-704.
20. Rockafellar R.T. Convex Analysis. 1970;Princeton University Press.
21. Shi Z.J. A new memory gradient method under exact line search. Asian Pac. J. Oper. Res. 20(2):2003.
22. Shi Z.J. The supermemory gradient method with inexact line searches. J. Appl. Sci. 21(3):2003.
23. Sanmatlas S., Vercher E. A generalized conjugate gradient algorithm. J. Optim. Theory Appl. 98(2):1998;489-502.
24. Todd M.J. On convergence properties of algorithms for unconstrained minimization. IMA J. Numer. Anal. 9:1989;435-441.
25. Wei Z., Qi L., Jiang H. Some convergence properties of descent methods. J. Optim. Theory Appl. 95(1):1997;177-188.
26. Vrahatis M.N., Androulakis G.S., Lambrino J.N., Magoulas G.D. A class of gradient unconstrained minimization algorithms with adaptive stepsize. J. Comput. Appl. Math. 114:2000;367-386.
27. Vrahatis M.N., Androulakis G.S., Manoussakis G.E. A new unconstrained optimization method for imprecise function and gradient values. J. Math. Anal. Appl. 197:1996;586-607.