Pages that link to "Item:Q2301128"

The following pages link to Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128):

Displayed 19 items.

• Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions (Q2020604) ‎ (← links)
• An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) ‎ (← links)
• A piecewise conservative method for unconstrained convex optimization (Q2070340) ‎ (← links)
• Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) ‎ (← links)
• Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) ‎ (← links)
• Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) ‎ (← links)
• Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) ‎ (← links)
• A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) ‎ (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) ‎ (← links)
• Sharpness, Restart, and Acceleration (Q5210521) ‎ (← links)
• A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) ‎ (← links)
• A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) ‎ (← links)
• Universal intermediate gradient method for convex problems with inexact oracle (Q5865342) ‎ (← links)
• Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization (Q5869821) ‎ (← links)
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) ‎ (← links)
• Practical perspectives on symplectic accelerated optimization (Q6087057) ‎ (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) ‎ (← links)
• Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) ‎ (← links)
• First-order methods for convex optimization (Q6169988) ‎ (← links)