An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

Bibliographic Details
Main Authors:	Cartis, C, Gould, N, Toint, P
Format:	Journal article
Published:	2012

Similar Items

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
by: Cartis, C, et al.
Published: (2012)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
by: Cartis, C, et al.
Published: (2010)

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
by: Cartis, C, et al.
Published: (2020)

Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
by: Cartis, C, et al.
Published: (2018)

On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2013)

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
by: Cartis, C, et al.
Published: (2011)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
by: Cartis, C, et al.
Published: (2012)

Adaptive cubic overestimation methods for unconstrained optimization
by: Cartis, C, et al.
Published: (2007)

Adaptive cubic overestimation methods for unconstrained optimization
by: Cartis, C, et al.
Published: (2007)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
by: Cartis, C, et al.
Published: (2011)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
by: Cartis, C, et al.
Published: (2011)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
by: Cartis, C, et al.
Published: (2017)

Adaptive regularization with cubics on manifolds
by: Agarwal, N, et al.
Published: (2020)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
by: Cartis, C, et al.
Published: (2019)

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2017)

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares.
by: Bellavia, S, et al.
Published: (2010)

Guiding Nonconvex Trajectory Optimization with Hierarchical Graphs of Convex Sets
by: von Wrangel, David
Published: (2024)

Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
by: Mazumder, Rahul, et al.
Published: (2021)

Complexity bounds for second-order optimality in unconstrained optimization.
by: Cartis, C, et al.
Published: (2012)

Global rates of convergence for nonconvex optimization on manifolds
by: Boumal, N, et al.
Published: (2018)

Universal regularization methods: varying the power, the smoothness and the accuracy
by: Cartis, C, et al.
Published: (2019)

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
by: Cartis, C, et al.
Published: (2019)

On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
by: Cartis, C, et al.
Published: (2015)

On the complexity of finding first-order critical points in constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2012)

A note on error bounds for convex and nonconvex programs
Published: (2003)

A note on error bounds for convex and nonconvex programs
Published: (2003)

Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
by: Adachi, S, et al.
Published: (2017)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2016)

On the convergence of a regularized Jacobi algorithm for convex optimization
by: Banjac, G, et al.
Published: (2017)

Regularized Jacobi iteration for decentralized convex quadratic optimization with separable constraints
by: Deori, L, et al.
Published: (2018)

Nonconvex robust optimization
by: Teo, Kwong Meng
Published: (2008)

A gradient-free distributed optimization method for convex sum of nonconvex cost functions
by: Pang, Yipeng, et al.
Published: (2023)

Duality for nonconvex approximation and optimization /
by: 315123 Singer, Ivan
Published: (2006)

A two-level distributed algorithm for nonconvex constrained optimization
by: Sun, Kaizhao, et al.
Published: (2022)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
by: Cartis, C, et al.
Published: (2013)

Convex Risk Bounded Continuous-Time Trajectory Planning in Uncertain Nonconvex Environments
by: Jasour, Ashkan, et al.
Published: (2022)

Analysis of critical points for nonconvex optimization
by: Å imÅ ek, Alp
Published: (2006)

Regression-based LP Solver for Chance-Constrained Finite Horizon Optimal Control with Nonconvex Constraints
by: Banerjee, Ashis, et al.
Published: (2011)

A Convex Optimization Framework for Regularized Geodesic Distances
by: Edelstein, Michal, et al.
Published: (2023)

On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods
by: Li, Haochuan
Published: (2022)