Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints

We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e., problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, is negligible compared to that of evaluating...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Cartis, C, Gould, N, Toint, P
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	Society for Industrial and Applied Mathematics 2020

Míreanna comhchosúla

Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2018)

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2012)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2012)

Complexity bounds for second-order optimality in unconstrained optimization.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2012)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2010)

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2011)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2017)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2011)

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2019)

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2017)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2019)

On the complexity of finding first-order critical points in constrained nonlinear optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2012)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2016)

On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2015)

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2012)

On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2013)

Global rates of convergence for nonconvex optimization on manifolds
de réir: Boumal, N, et al.
Foilsithe / Cruthaithe: (2018)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2013)

Adaptive cubic overestimation methods for unconstrained optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2007)

Adaptive cubic overestimation methods for unconstrained optimization
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2007)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2011)

A Quantum-Behaved Neurodynamic Approach for Nonconvex Optimization with Constraints
de réir: Zheng Ji, et al.
Foilsithe / Cruthaithe: (2019-07-01)

On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods
de réir: Li, Haochuan
Foilsithe / Cruthaithe: (2022)

Sharp focusing of a light field with polarization and phase singularities of an arbitrary order
de réir: Victor Kotlyar, et al.
Foilsithe / Cruthaithe: (2019-06-01)

A note on error bounds for convex and nonconvex programs
Foilsithe / Cruthaithe: (2003)

A note on error bounds for convex and nonconvex programs
Foilsithe / Cruthaithe: (2003)

Trust-region and other regularisations of linear least-squares problems
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2008)

Universal regularization methods: varying the power, the smoothness and the accuracy
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2019)

Trust-region and other regularisations of linear least-squares problems
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2009)

Nonconvex robust optimization
de réir: Teo, Kwong Meng
Foilsithe / Cruthaithe: (2008)

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
de réir: Cartis, C, et al.
Foilsithe / Cruthaithe: (2015)

Worst-case identification and complexity under bounded but low correlated noise
de réir: Chen, Kuang Han, 1967-
Foilsithe / Cruthaithe: (2005)

Containment Control for High-Order Heterogeneous Continuous-Time Multi-Agent Systems with Input Nonconvex Constraints
de réir: Jiahao Xu, et al.
Foilsithe / Cruthaithe: (2025-02-01)

Distributed Optimization Methods for Nonconvex Problems with Inequality Constraints over Time-Varying Networks
de réir: Jueyou Li, et al.
Foilsithe / Cruthaithe: (2017-01-01)

Duality for nonconvex approximation and optimization /
de réir: 315123 Singer, Ivan
Foilsithe / Cruthaithe: (2006)

On Convex Relaxations in Nonconvex Optimization
de réir: T. Westerlund, et al.
Foilsithe / Cruthaithe: (2011-04-01)

Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
de réir: Adachi, S, et al.
Foilsithe / Cruthaithe: (2017)

Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
de réir: Hu, Sha, S.M. Massachusetts Institute of Technology
Foilsithe / Cruthaithe: (2007)

Magnetic Resonance Image Denoising Based on Laplacian Prior Sparsity Constraint and Nonconvex Second-Order TV Penalty
de réir: Yumeng Ge, et al.
Foilsithe / Cruthaithe: (2023-07-01)

Asymptotic worst-case identification with bounded noise
Foilsithe / Cruthaithe: (2003)