Pages that link to "Item:Q5408206"
From MaRDI portal
The following pages link to An Optimal Algorithm for Constrained Differentiable Convex Optimization (Q5408206):
Displaying 7 items.
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Incremental accelerated gradient methods for SVM classification: study of the constrained approach (Q2355191) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)