Pages that link to "Item:Q5459820"
From MaRDI portal
The following pages link to Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820):
Displaying 5 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- Barrier subgradient method (Q633113) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
