Pages that link to "Item:Q2415906"

The following pages link to An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906):

Displaying 7 items.

• OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
• A computational evaluation of two subgradient search methods (Q1089257) (← 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)
• 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)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)