A Lifted \ell₁ Framework for Sparse Recovery

DOI10.1093/IMAIAI/IAAD055MaRDI QIDQ6393299zbMATH OpenFDO

Authors Yaghoub Rahimi, Sung Ha Kang, Yifei Lou

Publication date 9 March 2022

Full work available at URL https://doi.org/10.1093/IMAIAI/IAAD055

Mathematics Subject Classification ID

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

Abstract: Motivated by re-weighted $el{l}_1$ approaches for sparse recovery, we propose a lifted $el{l}_1$ (LL1) regularization which is a generalized form of several popular regularizations in the literature. By exploring such connections, we discover there are two types of lifting functions which can guarantee that the proposed approach is equivalent to the $el{l}_0$ minimization. Computationally, we design an efficient algorithm via the alternating direction method of multiplier (ADMM) and establish the convergence for an unconstrained formulation. Experimental results are presented to demonstrate how this generalization improves sparse recovery over the state-of-the-art.

Recommendations

• A novel regularization based on the error function for sparse recovery
• Sorted \(L_1/L_2\) minimization for sparse signal recovery
• Sparse recovery: the square of _1/_2 norms
• Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee

Cited in

(3)

• Sorted \(L_1/L_2\) minimization for sparse signal recovery
• Tight-frame-like analysis-sparse recovery using nontight sensing matrices
• Sparse recovery: the square of _1/_2 norms

This page was built for publication: A Lifted $\ell_1 $ Framework for Sparse Recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393299)