Pages that link to "Item:Q2082553"
From MaRDI portal
The following pages link to Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\) (Q2082553):
Displaying 18 items.
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- Accelerated proximal envelopes: application to componentwise methods (Q2116598) (← links)
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
- Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems (Q2156917) (← links)
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator (Q2289040) (← links)
- PDE acceleration: a convergence rate analysis and applications to obstacle problems (Q2336046) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization (Q2355319) (← links)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- Accelerated meta-algorithm for convex optimization problems (Q2656390) (← links)
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\) (Q2817843) (← links)
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods (Q2848187) (← links)
- Convergence Rates of Proximal Gradient Methods via the Convex Conjugate (Q4620416) (← links)
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)