This paper shows that the solutions to various 1-norm minimization problems are unique if, and only if, a common set of conditions are satisfied. This result applies broadly to the basis pursuit model, basis pursuit denoising model, Lasso model, as well as certain other 1-norm related models. This condition is previously known to be sufficient for the basis pursuit model to have a unique solution. Indeed, it is also necessary, and applies to a variety of 1-norm related models. The paper also discusses ways to recognize unique solutions and verify the uniqueness conditions numerically. The proof technique is based on linear programming strong duality and strict complementarity results.
This is a preview of subscription content, log in to check access
The authors thank Prof. Dirk Lorenz for bringing References  and  to their attention. The work of H. Zhang is supported by the Chinese Scholarship Council during his visit to Rice University, and in part by NUDT Funding of Innovation B110202. The work of W. Yin is supported in part by NSF Grants DMS-0748839 and ECCS-1028790. The work of L. Cheng is supported by NSFC Grants 61271014 and 61072118.
Candès, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489–509 (2006)CrossRefMATHGoogle Scholar
Grasmair, M., Scherzer, O., Haltmeier, M.: Necessary and sufficient conditions for linear convergence of \(\ell _1\)-regularization. Commun. Pure Appl. Math. 64(2), 161–182 (2011)CrossRefMATHMathSciNetGoogle Scholar
Dossal, C.: A necessary and sufficient condition for exact sparse recovery by \(\ell _1\) minimization. Comptes Rendus Mathematique 350(1), 117–120 (2012)CrossRefMATHMathSciNetGoogle Scholar
Fuchs, J.J.: Recovery of exact sparse representations in the presence of bounded noise. IEEE Trans. Inf. Theory 51(10), 3601–3608 (2005)CrossRefMATHGoogle Scholar