A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization

DOI10.1080/02331934.2020.1830088zbMath1489.90182OpenAlexW3157720155MaRDI QIDQ5085238

Rohollah Garmanjani

Publication date: 27 June 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1830088

zbMATH Keywords

worst-case complexityconvex smooth unconstrained optimizationnonlinear stepsize control algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization

Cites Work

• A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
• Worst case complexity of direct search
• Introductory lectures on convex optimization. A basic course.
• Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
• Cubic regularization of Newton method and its global performance
• On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
• Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
• Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
• On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
• Trust Region Methods
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
• The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
• Direct Search Based on Probabilistic Descent
• Worst case complexity of direct search under convexity

This page was built for publication: A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization