The evaluation complexity of finding high-order minimizers of nonconvex optimization
From MaRDI portal
Publication:6200212
DOI10.4171/icm2022/95OpenAlexW4389775191MaRDI QIDQ6200212
Phillipe L. Toint, Coralia Cartis, Nicholas I. M. Gould
Publication date: 22 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/95
nonconvex optimizationregularization methodscomplexity boundscomposite optimizationglobal rates of convergence
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Newton-type methods (49M15)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A proximal method for composite minimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
- Cubic regularization of Newton method and its global performance
- Some function classes related to the class of convex functions
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
