1. Berinde, R., Gilbert, A.C., Indyk, P., Karloff, H.J., Strauss, M.J.: Combining geometry and combinatorics: a unified approach to sparse signal recovery, preprint (2008)

2. Bertsekas D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)

   MATH  Google Scholar 

3. Bertsimas D., Tsitsiklis J.: Introduction to Linear Optimization, pp. 414. Athena Scientific, Belmont (1997)

   Google Scholar 

4. Blumensath T., Davies M.: Iterative hard thresholding for compressed sensing. Appl. Comp. Harmonic Anal.27, 265–274 (2009)

   Article MathSciNet MATH  Google Scholar 

5. Borwein, J.M., Luke, D.R.: Entropic Regularization of the ł₀ function, In: Fixed-point algorithms for Inverse Problems in Science and Engineering in Springer optimization and its Applications (2010)

6. Bruckstein A.M., Donoho D.L., Elad M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev.51(1), 34C81 (2009)

   Article MathSciNet  Google Scholar 

7. Candès E.J., Tao T.: Decoding by linear programming. IEEE Trans. Inf. Theory51, 4203–4215 (2005)

   Article  Google Scholar 

8. Candès E.J., Tao T.: Near optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. Inf. Theory52, 5406–5425 (2006)

   Article  Google Scholar 

9. Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14–10 (2009)

10. Chartrand, R.: Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data, In: IEEE International Symposium on Biomedical Imaging (ISBI) (2009)

11. Chen,X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions ofℓ₂-ℓ_p minimization, Technical Report, The Hong Kong, Polytechnic University (2009)

12. Donoho, D.: For most large underdetermined systems of linear equations the minimall₁-norm solution is also the sparsest Solution, Technical Report, Stanford University (2004)

13. Fan J., Li R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Soc.96, 1348–1360 (2001)

    MathSciNet MATH  Google Scholar 

14. Gilbert, A.C., Muthukrishnan, M., Strauss, M.J.: Approximation of functions over redundant dictionaries using coherence, In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003)

15. Garey M.R., Johnson D.S.: Strong NP-Completeness: results, motivation examples and implications. J. Assoc. Comput. Mach.25, 499–508 (1978)

    MathSciNet MATH  Google Scholar 

16. Garey M.R., Johnson D.S.: Computers and Intractability A Guide to the Theory of NP-Completeness, pp. 96–105. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

17. Mourad N., Reilly P.: Minimizing nonconvex functions for sparse vector reconstruction. IEEE Trans. Signal Process.58, 3485–3496 (2010)

    Article MathSciNet  Google Scholar 

18. Nesterov Y., Nemirovski A.: Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA (1994)

    Google Scholar 

19. Natarajan B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput.24, 227–234 (1995)

    Article MathSciNet MATH  Google Scholar 

20. Terlaky T.: Onℓ^p programming. Eur. J. Oper. Res.22, 70–100 (1985)

    Article MathSciNet MATH  Google Scholar 

21. Tropp J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Info. Theory50, 2231–2242 (2004)

    Article MathSciNet  Google Scholar 

22. Tropp, J., Wright, S.J.: Computational methods for sparse solutions of linear inverse problems. In: Proceedings of the IEEE (2010)

23. Vavasis S.A.: Polynomial time weak approximation algorithms for quadratic programming. In: Floudas, C.A., Pardalos, P.M. (eds) Complexity in Numerical Optimization, World Scientific, New Jersey (1993)

    Google Scholar 

24. Vazirani V.: Approximation Algorithms. Springer, Berlin (2003)

    Google Scholar 

25. Xue G., Ye Y.: An efficient algorithm for minimizing a sum of P-norms. SIAM J. Optim.10, 551–579 (2000)

    Article MathSciNet MATH  Google Scholar 

26. Ye Y.: On the complexity of approximating a KKT point of quadratic programming. Math. Progr.80, 195–211 (1998)

    Article MATH  Google Scholar 

27. Ye Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)

    MATH  Google Scholar 

Download references