Pages that link to "Item:Q2696573"

The following pages link to A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573):

Displayed 9 items.

• Additive Schwarz methods for convex optimization with backtracking (Q2122660) ‎ (← links)
• Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) ‎ (← links)
• Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) ‎ (← links)
• General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) ‎ (← links)
• NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems (Q2700171) ‎ (← links)
• Sharpness, Restart, and Acceleration (Q5210521) ‎ (← links)
• Practical perspectives on symplectic accelerated optimization (Q6087057) ‎ (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) ‎ (← links)
• On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) ‎ (← links)