Pages that link to "Item:Q1659678"

The following pages link to New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678):

Displayed 6 items.

• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) ‎ (← links)
• Accelerated first-order methods for hyperbolic programming (Q1717219) ‎ (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) ‎ (← links)
• Sharpness, Restart, and Acceleration (Q5210521) ‎ (← links)
• ``Efficient” Subgradient Methods for General Convex Optimization (Q5506689) ‎ (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) ‎ (← links)