Pages that link to "Item:Q2044496"
From MaRDI portal
The following pages link to Fastest rates for stochastic mirror descent methods (Q2044496):
Displaying 7 items.
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization (Q5076671) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
- Stochastic incremental mirror descent algorithms with Nesterov smoothing (Q6145577) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)