Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives
From MaRDI portal
Publication:5101935
DOI10.1137/1.9781611976991OpenAlexW4313052657MaRDI QIDQ5101935
Nicholas I. M. Gould, Coralia Cartis, Phillipe L. Toint
Publication date: 2 September 2022
Full work available at URL: https://doi.org/10.1137/1.9781611976991
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization, Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training, Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound, Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques, Adaptive Third-Order Methods for Composite Convex Optimization
