Efficient Algorithms for High-Dimensional Convex Subspace Optimization via Strict Complementarity

Garber, Dan, Fisher, Ron

Feb-8-2022–arXiv.org Machine Learning 

We consider optimization problems in which the goal is find a $k$-dimensional subspace of $\reals^n$, $k<