Pages that link to "Item:Q5962720"
From MaRDI portal
The following pages link to Worst case complexity of direct search under convexity (Q5962720):
Displaying 18 items.
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- Worst case complexity of direct search (Q743632) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- An indicator for the switch from derivative-free to derivative-based optimization (Q1728260) (← links)
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case (Q2826817) (← links)
- (Q4508391) (← links)
- Stochastic Three Points Method for Unconstrained Smooth Minimization (Q4971022) (← links)
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Direct Search Based on Probabilistic Descent (Q5502242) (← links)
- On the worst-case inefficiency of CGKA (Q6114271) (← links)
- Worst-case evaluation complexity of a derivative-free quadratic regularization method (Q6181370) (← links)
- Stochastic zeroth order descent with structured directions (Q6642789) (← links)
