Black-Box Complexity of Local Minimization
From MaRDI portal
Publication:4697309
DOI10.1137/0803004zbMath0794.90045OpenAlexW2056243826MaRDI QIDQ4697309
Publication date: 29 June 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6972
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)
Related Items (15)
A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function ⋮ Lower bounds for non-convex stochastic optimization ⋮ Lower bounds for finding stationary points I ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Lower bounds for finding stationary points II: first-order methods ⋮ Complexity bounds for second-order optimality in unconstrained optimization ⋮ On the complexity of finding first-order critical points in constrained nonlinear optimization ⋮ Complexity of general continuous minimization problems: a survey ⋮ On average complexity of global optimization problems ⋮ Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models ⋮ Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints ⋮ Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives ⋮ Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
This page was built for publication: Black-Box Complexity of Local Minimization
