Pages that link to "Item:Q2303662"
From MaRDI portal
The following pages link to Provable accelerated gradient method for nonconvex low rank optimization (Q2303662):
Displaying 6 items.
- On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
- Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis (Q2311982) (← links)
- CMD: controllable matrix decomposition with global optimization for deep neural network compression (Q2673311) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- Gradient descent with non-convex constraints: local concavity determines convergence (Q5242862) (← links)
