Black-Box Complexity of Local Minimization
From MaRDI portal
Publication:4697309
Recommendations
Cited in
(21)- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Lower bounds for non-convex stochastic optimization
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
- On average complexity of global optimization problems
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives
- Gradient descent in the absence of global Lipschitz continuity of the gradients
- How to trap a gradient flow
- Complexity of general continuous minimization problems: a survey
- Lower bounds for finding stationary points II: first-order methods
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Recent Theoretical Advances in Non-Convex Optimization
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Efficient unconstrained black box optimization
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls
- Lower bounds for finding stationary points I
- Complexity bounds for second-order optimality in unconstrained optimization
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
This page was built for publication: Black-Box Complexity of Local Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697309)
