Pages that link to "Item:Q2696573"
From MaRDI portal
The following pages link to A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573):
Displaying 15 items.
- Simple reordering techniques for expanding the convergence radius of first-order iterative techniques (Q1274213) (← links)
- Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
- Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Adaptive restart for accelerated gradient schemes (Q2355332) (← 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)
- A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods (Q6298398) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
