Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity

no code implementations • 8 Feb 2022 • Dan Garber, Ron Fisher

We consider optimization problems in which the goal is find a $k$-dimensional subspace of $\mathbb{R}^n$, $k<<n$, which minimizes a convex and smooth loss.