Pages that link to "Item:Q2052164"
From MaRDI portal
The following pages link to On the oracle complexity of smooth strongly convex minimization (Q2052164):
Displaying 14 items.
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- The exact information-based complexity of smooth convex minimization (Q511109) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- On parallel complexity of nonsmooth convex optimization (Q1342517) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- Oracle complexity of second-order methods for smooth convex optimization (Q2330652) (← links)
- Strong oracle optimality of folded concave penalized estimation (Q2510819) (← links)
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization (Q2902870) (← links)
- Convex Synthesis of Accelerated Gradient Algorithms (Q5020736) (← links)
- An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
- A robust control approach to asymptotic optimality of the heavy ball method for optimization of quadratic functions (Q6110012) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
