The evaluation complexity of finding high-order minimizers of nonconvex optimization
DOI10.4171/ICM2022/95OpenAlexW4389775191MaRDI QIDQ6200212FDOQ6200212
Philippe 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 optimizationcomplexity boundsregularization methodscomposite optimizationglobal rates of convergence
Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Newton-type methods (49M15)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Compressed sensing
- Title not available (Why is that?)
- A proximal method for composite minimization
- Some function classes related to the class of convex functions
- Title not available (Why is that?)
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Cubic regularization of Newton method and its global performance
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
- 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
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- On the use of third-order models with fourth-order regularization for unconstrained optimization
Cited In (1)
This page was built for publication: The evaluation complexity of finding high-order minimizers of nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200212)
