Pages that link to "Item:Q4697309"
From MaRDI portal
The following pages link to Black-Box Complexity of Local Minimization (Q4697309):
Displaying 14 items.
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
- Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
- On average complexity of global optimization problems (Q687095) (← links)
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400) (← links)
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
- A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (Q5299905) (← links)
- Complexity of general continuous minimization problems: a survey (Q5717540) (← links)
- Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
