Why l1 is a good approximation to l0: A geometric explanation

Journal of Uncertain Systems

Volumn 7, Issue 3, 2013, Pages 203-207

  Ramirez, Carlos ^a   Kreinovich, Vladik ^a,b   Argaez, Miguel ^a  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

^b University of Texas at El Paso   (United States)

Author keywords

L0 norm; L1 norm; Ockham razor; Sparse representation

Indexed keywords

EID: 84880637101     PISSN: 17528909     EISSN: 17528917     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. 1 algorithm for underdetermined systems and applications, IEEE Proceedings of the 2011 Annual Conference on North American Fuzzy Information Processing Society, pp.1-6, 2011.
2. Candès, E.J., J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, vol.59, pp.1207-1223, 2006.
3. Candès, E.J., and T. Tao, Decoding by linear programming, IEEE Transactions on Information Theory, vol.51, no.12, pp.4203-4215, 2005.
4. Donoho, D.L., Compressed sensing, IEEE Transactions on Information Theory, vol.52, no.4, pp.1289-1306, 2006.
5. Elad, M., Sparse and Redundant Representations, Springer Verlag, 2010.
6. Natarajan, B.K., Sparse approximate solutions to linear systems, SIAM Journal on Computing, vol.24, pp.227-234, 1995.
7. 1-minimization for underdetermined systems in classification of tumors with gene expression data, Proceedings of the IEEE 33rd Annual International Conference of the Engineering in Medicine and Biology Society, pp.3362-3366, 2011.
8. Vavasis, S.A., Nonlinear Optimization: Complexity Issues, Oxford University Press, New York, 1991.