Exact and approximate sparse solutions of underdetermined linear equations

SIAM Journal on Scientific Computing

Volumn 31, Issue 1, 2008, Pages 23-44

  Jokar, Sadegh ^a   Pfetsch, Marc E ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Basis pursuit; Maximum feasible subsystem problem; Orthogonal matching pursuit; Sparse representations

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMAL SYSTEMS; SIGNAL PROCESSING;

BASIS PURSUITS; LINEAR EQUATION SYSTEM; MAXIMUM FEASIBLE SUBSYSTEM PROBLEM; OPTIMAL SOLUTIONS; ORTHOGONAL MATCHING PURSUIT; SIGNAL-PROCESSING; SPARSE APPROXIMATIONS; SPARSE REPRESENTATION; SPARSE SIGNALS; SPARSE SOLUTIONS;

LINEAR EQUATIONS;

EID: 55049086609     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/070686676     Document Type: Article

References (40)

1. T. ACHTERBERG, Constraint Integer Programming, Ph.D. thesis, TU Berlin, Berlin, 2007, http://opus.kobv.de/tuberlin/volltexte/2007/ 1611/.
2. E. AMALDI, On the complexity of designing compact perceptrons and some consequences, in Electronic Proceedings of the Fifth International Symposium on Artificial Intelligence and Mathematics, E. Boros and R. Greiner, eds., RUTCOR, Fort Lauderdale, FL, 1999.
3. E. AMALDI AND V. KANN, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Theoret. Comput. Si., 209 (1998), pp. 237-260.
4. E. AMALDI, M. E. PFETSCH, AND L. E. TROTTER, JR., On the maximum feasible subsystem problem, IISs, and IIS-hypergraphs, Math. Program., 95 (2003), pp. 533-554.
5. K. BENNETT AND O. MANGASARIAN, Bilinear separation of two sets in n-space, Comput. Optim. Appl., 2 (1993), pp. 207-227.
6. K. P. BENNETT AND E. J. BREDENSTEINER, A parametric optimization method for maschine learning, INFORMS J. Comput., 9 (1997), pp. 311-318.
7. E. J. CANOÈS AND J. ROMBERG, Quantitative robust uncertainty principles and optimally sparse decompositions, Found. Comput. Math., 6 (2006), pp. 227-254.
8. E. J. CANOÈS, J. ROMBERG, AND T. TAO, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
9. E. J. CANOÈS, J. ROMBERG, AND T. TAO, Stable signal recovery from incomplete and inaccurate measurements, Commun. Pure Appl. Math., 59 (2006), pp. 1207-1223.
10. E. J. CANOÉS, M. RUDELSON, T. TAO, AND R. VERSHYNIN, Error correction via linear programming, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS05), IEEE, Piscataway, NJ, 2005, pp. 295-308.
11. E. J. CANDÈS AND T. TAO, Decoding by linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 4203-4215.
12. S. S. CHEN, Basis Pursuit, Ph.D. thesis, Stanford University, Palo Alto, CA, 1995.
13. S. S. CHEN, D. L. DONOHO, AND M. A. SAUNDER.S, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., 20 (1999), pp. 33-61.
14. J. W. CHINNECK, Fast heuristics for the maximum feasible subsystem problem, INFORMS J. Comput., 13 (2001), pp. 210-223.
15. G. DAVIS, S. MALLAT, AND Z. ZHANG, Adaptive time-frequency decompositions with matching pursuits, Optim. Eng., 33 (1994), pp. 2183-2191.
16. D. L. DONOHO, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
17. 1-norm near-solution approximates the sparsest near-solution, Commun. Pure Appl. Math., 59 (2006), pp. 907-934.
18. 1-norm solution is also the sparsest solution, Commun. Pure Appl. Math., 59 (2006), pp. 797-829.
19. 1 minimization, Proc. Natl. Acad. Sci. USA, 100 (2003), pp. 2197-2202.
20. D. L. DONOHO AND M. ELAD, On the stability of the basis pursuit in the presence of noise, Signal Process., 86 (2006), pp. 511-532.
21. D. L. DONOHO, M. ELAD, AND V. TEMLYAKOV, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inform. Theory, 52 (2006), pp. 6-18.
22. D. L. DONOHO AND X. HUO, Uncertainty principles and ideal atomic decomposition, IEEE Trans. Inform. Theory, 47 (2001), pp. 2845-2862.
23. D. L. DONOHO, Y. TSAIG, I. DRORI, AND J.-L. STARCK, Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit, Technical report 2006-02, Stanford, Department of Statistics, Palo Alto, CA, 2006.
24. M. ELAD, Sparse representations are most likely to be the sparsest possible, EURASIP J. Appl. Signal Process., 2006 (2006), pp. 1-12.
25. M. ELAD AND A. M. BRUCKSTEIN, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Trans. Inform. Theory, 48 (2002), pp. 2558-2567.
26. J. J. FUCHS, Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inform. Theory, 51 (2005), pp. 3601-3608.
27. J.-J. FUCHS, Recovery conditions of sparse representations in the presence of noise, in Proc. ICASSP 2006, IEEE, 2006, pp. 337-340.
28. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
29. S. MALLAT AND Z. ZHANG, Matching pursuit in a time-frequency dictionary, IEEE Trans. Inform. Theory, 41 (1993), pp. 3397-3415.
30. O. L. MANGASARIAN, Minimum-support solutions of polyhedral concave programs, Optimization, 45 (1999), pp. 149-162.
31. B. K. NATARAJAN, Sparse approximate solutions to linear systems, SIAM J. Comput., 24 (1995), pp. 227-234.
32. Y. C. PATI, R. REZAIIFAR, AND P. S. KRISHNAPRASAD, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decompositions, in Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, A. Singh, ed., IEEE, Piscataway, NJ, 1993.
33. M. E. PFETSCH, The Maximum Feasible Subsystem Problem and Vertex-Facet Incidence of Polyhedra, Ph.D. thesis, TU Berlin, Berlin, 2002.
34. M. E. PFETSCH, Branch-and-cut for the maximum feasible subsystem problem, SIAM J. Optim., 19 (2008), pp. 21-38.
35. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley, Chichester, 1986 reprint 1998.
36. T. STROHMER AND J. ROBERT W. HEATH, Grassmannian frames with applications to coding and communication, Appl. Comput. Harmon. Anal., 14 (2003), pp. 257-275.
37. J. TROPP AND A. C. GILBERT, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. Inform. Theory, 53 (2007), pp. 4655-4666.
38. J. A. TROPP, Greed is good: Algorithmic results for sparse approximations, IEEE Trans. Inform. Theory, 50 (2004), pp. 2231-2242.
39. J. A. TROPP, Just relax: Convex programming methods for identifying sparse signals in noise, IEEE Trans. Inform. Theory, 52 (2006), pp. 1030-1051.
40. G. YARMISH, Wavelet decomposition via the standard tableau simplex method of linear programming, WSEAS Trans. Math., 6 (2007), pp. 170-177.