Pages that link to "Item:Q1689457"
From MaRDI portal
The following pages link to Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457):
Displaying 7 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← 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)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
