Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
DOI10.1007/978-3-030-12767-1_2zbMATH Open1425.90113OpenAlexW2251768944MaRDI QIDQ2337587FDOQ2337587
Authors: Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint 
Publication date: 20 November 2019
Full work available at URL: http://purl.org/net/epubs/manifestation/27207452/RAL-TR-2015-010.pdf
Recommendations
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (14)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
- On regularization and active-set methods with complexity for constrained optimization
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- An active set trust-region method for bound-constrained optimization
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
This page was built for publication: Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337587)
