A note on the complexity of Lp minimization

Mathematical Programming

Volumn 129, Issue 2, 2011, Pages 285-299

  Ge, Dongdong ^a   Jiang, Xiaoye ^b   Ye, Yinyu ^b  

^a Shanghai   (China)

^b Stanford University   (United States)

Author keywords

Global optimization; Interior point method; Nonconvex programming; Sparse solution reconstruction

Indexed keywords

COMPLEXITY BOUNDS; COMPRESSED SENSING; COMPUTATIONAL RESULTS; INTERIOR-POINT METHOD; LOCAL MINIMIZER; MINIMAL VALUE; MINIMIZATION PROBLEMS; NON-CONVEX PROGRAMMING; POLYNOMIAL-TIME; POTENTIAL REDUCTION; SPARSE SOLUTION RECONSTRUCTION; SPARSE SOLUTIONS; STRONGLY NP-HARD;

ALGORITHMS; GLOBAL OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 81155134641     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-011-0470-2     Document Type: Article

References (27)

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)
3. Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. pp. 414, Athena Scientific, Belmont (1997)
4. Blumensath,T.,Davies,M.: Iterative hard thresholding for compressed sensing. Appl.Comp. Harmonic Anal. 27, 265-274 (2009)
5. 0 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)
7. Candes, E.J., Tao, T.:Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203-4215 (2005) (Pubitemid 41800353)
8. Candes, E.J., Tao, T.: Near optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. Inf. Theory 52, 5406-5425 (2006) (Pubitemid 46445381)
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. p minimization, Technical Report, The Hong Kong, Polytechnic University (2009)
12. Donoho, D.: Formost large underdetermined systems of linear equations theminimal l1-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) (Pubitemid 33695585)
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)
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)
17. Mourad, N., Reilly, P.: Minimizing nonconvex functions for sparse vector reconstruction. IEEE Trans. Signal Process. 58, 3485-3496 (2010)
18. Nesterov, Y., Nemirovski, A.: Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA (1994)
19. Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 227-234 (1995)
20. p programming. Eur. J. Oper. Res. 22, 70-100 (1985)
21. Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Info. Theory 50, 2231-2242 (2004)
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)
24. Vazirani, V.: Approximation Algorithms. Springer, Berlin (2003)
25. Xue, G., Ye, Y.: An efficient algorithm for minimizing a sum of P-norms. SIAM J. Optim. 10, 551-579 (2000)
26. Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Math. Progr. 80, 195-211 (1998) (Pubitemid 128430908)
27. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)