Pages that link to "Item:Q4641666"
From MaRDI portal
The following pages link to Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666):
Displaying 13 items.
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Solving composite fixed point problems with block updates (Q2042410) (← links)
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
- Linear convergence of cyclic SAGA (Q2193004) (← links)
- (Q4969198) (← links)
- A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm (Q5220423) (← links)
- IQN: An Incremental Quasi-Newton Method with Local Superlinear Convergence Rate (Q5745078) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator (Q6126596) (← links)
- Random-reshuffled SARAH does not need full gradient computations (Q6204201) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
- The geometry of monotone operator splitting methods (Q6598417) (← links)
