Harry Goulbourne

Faster proximal algorithms for matrix optimization using Jacobi-based eigenvalue methods

We consider proximal splitting algorithms for convex optimization problems over matrices. A significant computational bottleneck in many of these algorithms is the need to compute a full eigenvalue or singular value decomposition at each iteration for the evaluation of a proximal operator. In this p…