A Laplacian Approach to $ell_1$-Norm Minimization
arXiv: Data Structures and Algorithms, 2019.
We propose a novel differentiable reformulation of the linearly-constrained $ell_1$ minimization problem, also known as the basis pursuit problem. The reformulation is inspired by the Laplacian paradigm of network theory and leads to a new family of gradient-based, matrix-free methods for the solution of $ell_1$ minimization problems. We ...More
PPT (Upload PPT)