Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares

DOI10.1109/TSP.2015.2421476zbMath1394.94555arXiv1406.4802MaRDI QIDQ4580645

David Brie, Jérôme Idier, Charles Soussen, Junbo Duan

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.4802

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (11)

Global optimization for sparse solution of least squares problems ⋮ Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction ⋮ Newton method for \(\ell_0\)-regularized optimization ⋮ Constraint matrix factorization for space variant PSFs field restoration ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem ⋮ Unnamed Item ⋮ A fast homotopy algorithm for gridless sparse recovery ⋮ The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy ⋮ Weighted thresholding homotopy method for sparsity constrained optimization

This page was built for publication: Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares