On the Complexity of an Inexact Restoration Method for Constrained Optimization
From MaRDI portal
Publication:5210514
DOI10.1137/18M1216146zbMath1453.90162OpenAlexW2997657492WikidataQ126413316 ScholiaQ126413316MaRDI QIDQ5210514
José Mario Martínez, Luís Felipe Bueno
Publication date: 21 January 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1216146
complexityregularizationconstrained optimizationfirst-order methodscontinuous optimizationinexact restoration methods
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items
Inexact restoration for derivative-free expensive function minimization and applications, Nonmonotone inexact restoration approach for minimization with orthogonality constraints, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
Cites Work
- Unnamed Item
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Inexact restoration method for minimization problems arising in electronic structure calculations
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Complexity bounds for second-order optimality in unconstrained optimization
- An inexact-restoration method for nonlinear bilevel programming problems
- Local convergence of an inexact-restoration method and numerical experiments
- Optimal quadratic programming algorithms. With applications to variational inequalities
- A new line search inexact restoration approach for nonlinear programming
- A practical optimality condition without constraint qualifications for nonlinear programming
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- Inexact restoration for Euler discretization of box-constrained optimal control problems
- Inexact-restoration algorithm for constrained optimization
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- Assessing the reliability of general-purpose inexact restoration methods
- A flexible inexact-restoration method for constrained optimization
- Bilevel optimization with a multiobjective problem in the lower level
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Cubic regularization of Newton method and its global performance
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- Numerical Optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On High-order Model Regularization for Constrained Optimization
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- On Regularization and Active-set Methods with Complexity for Constrained Optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- Augmented Lagrangians, box constrained QP and extensions
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
- On sequential optimality conditions for smooth constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
