On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming

SIAM Journal on Optimization

Volumn 21, Issue 4, 2011, Pages 1721-1739

  Cartis, Coralia ^a   Gould, Nicholas I M ^b   Toint, Philippe L ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^c UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Exact penalty methods; Global complexity bounds; Global rate of convergence; Nonlinear programming; Nonsmooth optimization; Quadratic regularization methods; Steepest descent methods; Trust region methods

Indexed keywords

COMPLEXITY BOUNDS; EXACT PENALTIES; GLOBAL RATE OF CONVERGENCE; NONSMOOTH OPTIMIZATION; QUADRATIC REGULARIZATION METHODS; STEEPEST DESCENT; TRUST-REGION METHODS;

APPROXIMATION THEORY; CONSTRAINED OPTIMIZATION; DYNAMIC LOADS; FUNCTION EVALUATION; NONLINEAR PROGRAMMING;

STEEPEST DESCENT METHOD;

EID: 84856057771     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/11082381X     Document Type: Article

References (15)

1. R. H. Byrd, N. I.M. Gould, J. Nocedal, and R. A.Waltz, On the convergence of successive linear-quadratic programming algorithms, SIAM J. Optim., 16 (2005), pp. 471-489.
2. C. Cartis, N. I. M. Gould, and Ph. L. Toint, Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function-and derivative-evaluation complexity, Math. Program., 130 (2011), pp. 295-319.
3. C. Cartis, N. I. M. Gould, and Ph. L. Toint, An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity, IMA J. Numer. Anal., to appear.
4. C. Cartis, N. I. M. Gould, and Ph. L. Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization, SIAMJ. Optim., 20 (2010), pp. 2833-2852.
5. A. R. Conn, N. I. M. Gould, and Ph. L. Toint, Trust-Region Methods, SIAM, Philadelphia, 2000.
6. R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley & Sons, New York, 1987.
7. N. I. M. Gould and Ph. L. Toint, Nonlinear programming without a penalty function or a filter, Math. Program., 122 (2010), pp. 155-196.
8. S. Gratton, M. Mouffe, Ph. L. Toint, and M. Weber-Mendonça, A recursive trust-region method in infinity norm for bound-constrained nonlinear optimization, IMA J. Numer. Anal., 28 (2008), pp. 827-861.
9. S. Gratton, A. Sartenaer, and Ph. L. Toint, Recursive trust-region methods for multiscale nonlinear optimization, SIAM J. Optim., 19 (2008), pp. 414-444.
10. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms I, Springer-Verlag, Berlin, Heidelberg, 1993.
11. Y. Nesterov, Introductory Lectures on Convex Optimization, Kluwer Academic, Dordrecht, The Netherlands, 2004.
12. Y. Nesterov, Gradient Methods for Minimizing Composite Objective Function, CORE Discussion Paper 2007/76, Université Catholique de Louvain, Belgium, 2007.
13. Y. Nesterov, Modified Gauss-Newton scheme with worst case guarantees for global performance, Optim. Methods Software, 22 (2007), pp. 469-483. (Pubitemid 46479853)
14. J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed., Springer-Verlag, New York, 2006.
15. Y. Yuan, Conditions for convergence of trust region algorithms for non-smooth optimization, Math. Program., 31 (1985), pp. 220-228. (Pubitemid 15478434)