Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
From MaRDI portal
Publication:4594856
DOI10.1080/10556788.2016.1268136zbMath1380.90252OpenAlexW2155823647MaRDI QIDQ4594856
No author found.
Publication date: 24 November 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/12297419/RAL-P-2014-014.pdf
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items (9)
The evaluation complexity of finding high-order minimizers of nonconvex optimization ⋮ The impact of noise on evaluation complexity: the deterministic trust-region case ⋮ Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy ⋮ On the quality of first-order approximation of functions with Hölder continuous gradient ⋮ Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality ⋮ Regional complexity analysis of algorithms for nonconvex smooth optimization ⋮ A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization ⋮ Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints ⋮ Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
This page was built for publication: Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
