1 code implementation • 27 Jan 2019 • Samy Wu Fung, Sanna Tyrväinen, Lars Ruthotto, Eldad Haber
Solution of the least-squares problem can be be accelerated by pre-computing a factorization or preconditioner, and the separability in the smooth, convex problem can be easily parallelized across examples.