On High-order Model Regularization for Constrained Optimization
Author:
- José Mario MartínezJMJosé Mario Martínez
- 1 January 2017
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 27 (4) , 2447-2458
Abstract
In two recent papers regularization methods based on Taylor polynomial models for minimization were proposed that only rely on Hölder conditions on the higher-order employed derivatives. Grapiglia and Nesterov considered cubic regularization with a sufficient descent condition that uses the current gradient and resembles the classical Armijo's criterion. Cartis, Gould, and Toint used Taylor models with arbitrary-order regularization and defined methods that tackle convex constraints employing the descent criterion that compares actual reduction with predicted reduction. The methods presented in this paper consider general (not necessarily Taylor) models of arbitrary order, employ a very mild descent criterion, and handle general, nonnecessarily convex, constraints. Complexity results are compatible with the ones presented in the papers mentioned above.Keywords
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2010/10133-0)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2013/03447-6, 2013/05475-7, 2013/07375-0)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
This publication has 25 references indexed in Scilit:
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained OptimizationSIAM Journal on Optimization, 2017
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized modelsMathematical Programming, 2016
- A trust region algorithm with a worst-case iteration complexity of $\mathcal{O}(\epsilon ^{-3/2})$ O ( ϵ - 3 / 2 ) for nonconvex optimizationMathematical Programming, 2016
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order ModelsSIAM Journal on Optimization, 2016
- On sequential optimality conditions for smooth constrained optimizationOptimization, 2011
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexityMathematical Programming, 2010
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization ProblemsSIAM Journal on Optimization, 2010
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic ConsequencesSIAM Journal on Optimization, 2010
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical resultsMathematical Programming, 2009
- Globally convergent trust-region methods for self-consistent field electronic structure calculationsThe Journal of Chemical Physics, 2004