A nonmonotone adaptive trust region method and its convergence

Computers and Mathematics with Applications

Volumn 45, Issue 10-11, 2003, Pages 1469-1477

  Zhang, Ju Liang ^a   Zhang, Xiang Sun ^b  

^a Tsinghua University   (China)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Global convergence; Nonmonotone linesearch technique; Superlinear convergence; Trust region method; Unconstrained optimization

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA;

TRUST REGION METHOD;

CONVERGENCE OF NUMERICAL METHODS;

EID: 0038006672     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(03)00130-5     Document Type: Article

References (18)

1. X.S. Zhang, J.L. Zhang and L.Z. Liao, An adaptive trust region method and its convergence, Science in China 45, 620-631, (2002).
2. R.B. Schnabel and E. Eskow, A new modified Cholesky factorization, SIAM J. Sci. Stat. Comput. 11, 1136-1158, (1990).
3. J.J. Moré, B.S. Garbow and K.E. Hillstrom, Testing unconstrained optimization software, ACM Trans. Math. Software 7 (1), 17-41, (1981).
4. R. Fletcher, Practical Method of Optimization, Unconstrained Optimization, Volume 1, John Wiley, New York, (1980).
5. J.J. Moré, Recent developments in algorithms and software for trust region methods, In Mathematical Programming: The State of the Art, (Edited by A. Bachem, M. Grötchel and B. Körte), pp. 258-287, Springer-Verlag, Berlin, (1983).
6. M.J.D. Powell, Convergence properties of a class minimization algorithms, In Nonlinear Programming 2, (Edited by O.L. Mangasarian, R.R, Meyer and S.M. Robinson), pp. 1-27, Academic Press, New York, (1975).
7. M.J.D. Powell, On the global convergence of trust region algorithms for unconstrained optimization, Math. Prog. 29, 297-303, (1984).
8. G.A. Schultz, R.B. Schnabel and R.H. Byrd, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence, SIAM J. Numer. Anal. 22, 47-67, (1985).
9. Y. Yuan, On the convergence of trust region algorithms, Mathematica Numerica Sinica 16, 333-346, (1996).
10. Y. Yuan and W. Sun, Optimization: Theorem and Application, (in Chinese), Science Publish House of China, (1997).
11. L. Grippo, F. Lampariello and S, Lucidi, A nonmonotone linesearch technique for Newton's method, SIAM J. on Numerical Analysis 23, 707-716, (1986).
12. L. Grippo, F. Lampariello and S. Lucidi, A truncated Newton method with nonmonotone linesearch for unconstrained optimization, Journal of Optimization Theory and Application 89, 401-419, (1989).
13. Ph.L. Toint, Non-monotone trust region algorithm for nonlinear optimization subject to convex constraints, Math. Prog. 77, 69-94, (1997).
14. Ph.L. Toint, An assessment of non-monotone linesearch techniques for unconstrained optimization, SIAM J. J. Sci Comp. 17, 725-739, (1996).
15. N.Y. Deng, Y. Xiao and F.J. Zhou, Nonmonotone trust region algorithm, Journal of Optimization Theory and Application 78, 259-285, (1993).
16. Y. Xiao and F.J. Zhou, Nonmonotone trust region methods with curvilinear path in unconstrained minimization, Computing 48, 303-317, (1992).
17. S. Ulbrich and M. Ulbrich, Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function, Tech. Report, Department of Computational and Applied Mathematics, Rice University, (2000).
18. X. Ke, Trust region methods for nonlinear programming, Ph.D. Dissertation, Institute of Applied Mathematics, CAS, (1993).