Adaptive restart of accelerated gradient methods under local quadratic growth condition
From MaRDI portal
Recommendations
- Adaptive restart for accelerated gradient schemes
- Adaptive restart of the optimized gradient method for convex optimization
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- Restart of Accelerated First-Order Methods With Linear Convergence Under a Quadratic Functional Growth Condition
- Accelerate stochastic subgradient method by leveraging local growth condition
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- scientific article; zbMATH DE number 4099037
- On restart procedures for the conjugate gradient method
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Stochastic optimization with adaptive restart: a framework for integrated local and global learning
Cited in
(29)- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- A piecewise conservative method for unconstrained convex optimization
- A review of nonlinear FFT-based computational homogenization methods
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Fast gradient methods for uniformly convex and weakly smooth problems
- A simple nearly optimal restart scheme for speeding up first-order methods
- On the complexity analysis of the primal solutions for the accelerated randomized dual coordinate ascent
- Differentially Private Accelerated Optimization Algorithms
- Sharpness, restart, and acceleration
- Universal intermediate gradient method for convex problems with inexact oracle
- Practical perspectives on symplectic accelerated optimization
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions
- A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient
- Lippmann-Schwinger solvers for the computational homogenization of materials with pores
- Parameter-free FISTA by adaptive restart and backtracking
- Perseus: a simple and optimal high-order method for variational inequalities
- Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
- Practical proximal primal-dual algorithms for structured saddle point problems
- Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
- FISTA restart using an automatic estimation of the growth parameter
- Restarts subject to approximate sharpness: a parameter-free and optimal scheme for first-order methods
- A preconditioned difference of convex functions algorithm with extrapolation and line search
- A speed restart scheme for a dynamical system with hessian-driven damping and three constant coefficients
- An adaptive parameter-free and projection-free restarting level set method for constrained convex optimization under the error bound condition
- A simple uniformly optimal method without line search for convex optimization
This page was built for publication: Adaptive restart of accelerated gradient methods under local quadratic growth condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243267)
