Pages that link to "Item:Q304218"
From MaRDI portal
The following pages link to OSGA: a fast subgradient algorithm with optimal complexity (Q304218):
Displaying 13 items.
- 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)
- 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)
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization (Q2921184) (← links)
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization (Q3988952) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
- The unitary 𝕀–spherical dual for split 𝕡–adic groups of type 𝔽₄ (Q4674799) (← links)
- The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
- On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints (Q5860603) (← links)
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems (Q6601206) (← links)
