Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
From MaRDI portal
Publication:2001208
Abstract: Necessary conditions for high-order optimality in smooth nonlinear constrained optimization are explored and their inherent intricacy discussed. A two-phase minimization algorithm is proposed which can achieve approximate first-, second- and third-order criticality and its evaluation complexity is analyzed as a function of the choice (among existing methods) of an inner algorithm for solving subproblems in each of the two phases. The relation between high-order criticality and penalization techniques is finally considered, showing that standard algorithmic approaches will fail if approximate constrained high-order critical points are sought.
Recommendations
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On the complexity of finding first-order critical points in constrained nonlinear optimization
Cites work
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- 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
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Convex Analysis
- Cubic regularization of Newton method and its global performance
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- Direct search based on probabilistic descent
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- Linearly constrained non-Lipschitz optimization for image restoration
- Metric regularity, tangent sets, and second-order optimality conditions
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- On a global complexity bound of the Levenberg-marquardt method
- On High-order Model Regularization for Constrained Optimization
- On Nesterov's smooth Chebyshev-Rosenbrock function
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Optimality Conditions for Degenerate Extremum Problems with Equality Constraints
- Point-to-Set Maps in Mathematical Programming
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- The \(p\)th-order optimality conditions for inequality constrained optimization problems
- Trust Region Methods
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Worst case complexity of direct search
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Cited in
(17)- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- An adaptive high order method for finding third-order critical points of nonconvex optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- The evaluation complexity of finding high-order minimizers of nonconvex optimization
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- Hessian barrier algorithms for non-convex conic optimization
- On squared-variable formulations
- Complexity analysis of inexact cubic-regularized primal-dual methods for finding second-order stationary points
This page was built for publication: Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001208)
