Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints

Mathematical Programming, Series B

Volumn 77, Issue 3, 1997, Pages 69-94

  Toint, Philippe L ^a  

^a UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Convex constraints; Non monotone algorithms; Trust regions

Indexed keywords

EID: 0001898672     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02614518     Document Type: Article

References (28)

1. I. Bongartz, A.R. Conn, N.I.M. Gould and Ph.L. Toint, CUTE: Constrained and unconstrained testing environment, ACM Transactions on Mathematical Software 21 (1995) 123-160.
2. J.F. Bonnans, E. Panier, A. Tits and J.L. Zhou, Avoiding the Maratos effect by means of a nonmonotone linesearch II: Inequality constrained problems - feasible iterates, SIAM Journal on Numerical Analysis 29 (1992) 1187-1202.
3. J.V. Burke and J.J. Moré, On the identification of active constraints, SIAM Journal on Numerical Analysis 25 (1988) 1197-1211.
4. J.V. Burke, J.J. Moré and G. Toraldo, Convergence properties of trust region methods for linear and convex constraints, Mathematical Programming, Series A 47 (1990) 305-336.
5. P.H. Calamai and J.J. Moré, Projected gradient methods for linearly constrained problems, Mathematical Programming 39 (1987) 93-116.
6. R.M. Chamberlain, C. Lemaréchal, H.C. Pedersen and M.J.D. Powell, The watchdog technique for forcing convergence in algorithms for constrained optimization, Mathematical Programming Studies 16 (1982) 1-17.
7. A.R. Conn, N.I.M. Gould and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis 25 (1988) 433-460; 26 (1989) 764-767.
8. A.R. Conn, N.I.M. Gould and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis 25 (1988) 433-460; 26 (1989) 764-767.
9. A.R. Conn, N.I.M. Gould and Ph.L. Toint, LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A) (Springer Verlag, Heidelberg, Berlin, New York, 1992).
10. A.R. Conn, Nick Gould, A. Sartenaer and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints, SIAM Journal on Optimization 3 (1993) 164-221.
11. A.R. Conn, Nick Gould, A. Sartenaer and Ph.L. Toint, Convergence properties of an augmented Lagrangian algorithms for optimization with a combination of general equality and linear constraints, SIAM Journal on Optimization 33 (1993) 61-75.
12. N.Y. Deng, Y. Xiao and F.J. Zhou, Nonmonotonic trust region algorithms, Journal of Optimization Theory and Applications 76 (1993) 259-285.
13. J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
14. F. Facchinei and S. Lucidi, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Journal of Optimization Theory and Applications 76 (1993) 241-257.
15. R. Fletcher, Practical Methods of Optimization (Wiley, Chichester, UK, 2nd edn., 1987).
16. L. Grippo, F. Lampariello and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM Journal on Numerical Analysis 23 (1986) 707-716.
17. L. Grippo, F. Lampariello and S. Lucidi, A truncated Newton method with nonmonotone line search for unconstrained optimization, Journal of Optimization Theory and Applications 60 (1989) 401-419.
18. L. Grippo, F. Lampariello and S. Lucidi, A class of nonmonotone stabilization methods in unconstrained optimization, Numerische Mathematik 59 (1991) 779-805.
19. J.J. Moré, Recent developments in algorithms and software for trust region methods, in: A. Bachem, M. Grötschel and B. Korte, eds., Mathematical Programming: The State of the Art (Springer Verlag, Heidelberg, 1983) 258-287.
20. J.J. Moré, Trust regions and projected gradients, in: M. Iri and K. Yajima, eds., System Modelling and Optimization (Springer Verlag, Heidelberg, 1988) 1-13.
21. E. Panier and A. Tits, Avoiding the Maratos effect by means of a nonmonotone linesearch I: general constrained problems, SIAM Journal on Numerical Analysis 28 (1991) 1183-1195.
22. R.B. Schnabel and E. Eskow, A new modified Cholesky factorization, SIAM Journal on Scientific and Statistical Computing 11 (1991) 1136-1158.
23. T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM Journal on Numerical Analysis 20 (1983) 626-637.
24. Ph.L. Toint, Towards an efficient sparsity exploiting Newton method for minimization, in: I.S. Duff, ed., Sparse Matrices and Their Uses (Academic Press, London, 1981) 57-88.
25. Ph.L. Toint, Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space, IMA Journal of Numerical Analysis 8 (1988) 231-252.
26. Ph.L. Toint, A non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints: the complete numerical results, Technical Report 94/26, Department of Mathematics (FUNDP, Namur, Belgium, 1994).
27. Ph.L. Toint, An assessment of non-monotone linesearch techniques for unconstrained optimization, SIAM Journal on Scientific Computing 17 (1996) 725-739.
28. Y. Xiao and F.J. Zhou, Nonmonotone trust region methods with curvilinear path in unconstrained optimization, Computing 48 (1992) 303-317.