Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
From MaRDI portal
Publication:1785005
DOI10.1007/s10208-017-9363-yzbMath1405.90125OpenAlexW2753896574WikidataQ58185637 ScholiaQ58185637MaRDI QIDQ1785005
Coralia Cartis, Nick I. M. Gould, Phillipe L. Toint
Publication date: 27 September 2018
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:3c1ac5c6-dfe3-4b5c-8123-e95e8ecba423
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Tensor methods for finding approximate stationary points of convex functions, Finding second-order stationary points in constrained minimization: a feasible direction approach, Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques, The evaluation complexity of finding high-order minimizers of nonconvex optimization, Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points, A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization, A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization, On constrained optimization with nonconvex regularization, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds, A concise second-order complexity analysis for unconstrained optimization using high-order regularized models, Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints, An adaptive high order method for finding third-order critical points of nonconvex optimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint, A control-theoretic perspective on optimal high-order optimization, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- On the optimal order of worst case complexity of direct search
- Practical inexact proximal quasi-Newton method with global complexity analysis
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Metric regularity, tangent sets, and second-order optimality conditions
- On a global complexity bound of the Levenberg-marquardt method
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Complexity bounds for second-order optimality in unconstrained optimization
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Worst case complexity of direct search
- Second-order and related extremality conditions in nonlinear programming
- The \(p\)th-order optimality conditions for inequality constrained optimization problems
- Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
- Introductory lectures on convex optimization. A basic course.
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Cubic regularization of Newton method and its global performance
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- 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
- First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
- Numerical Optimization
- Optimality Conditions for Degenerate Extremum Problems with Equality Constraints
- Trust Region Methods
- On High-order Model Regularization for Constrained Optimization
- ARCq: a new adaptive regularization by cubics
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- On Nesterov's smooth Chebyshev–Rosenbrock function
- Direct Search Based on Probabilistic Descent
- Point-to-Set Maps in Mathematical Programming
