Recovery of sparse probability measures via convex programming

Advances in Neural Information Processing Systems

Volumn 3, Issue , 2012, Pages 2420-2428

  Pilanci, Mert ^a   El Ghaoui, Laurent ^a   Chandrasekaran, Venkat ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE CONSTRAINTS; CARDINALITY PROBLEMS; CONVEX CONSTRAINTS; GAUSSIAN MIXTURES; MOMENT CONSTRAINTS; PROBABILITY MEASURES; SECOND ORDER CONE PROGRAMS; SUFFICIENT CONDITIONS;

CONVEX PROGRAMMING; RECOVERY;

PROBABILITY;

EID: 84877731088     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. E.J. Candés, T. Tao, "Decoding by linear programming". IEEE Trans. Inform. Theory 51 (2005), 4203-4215.
2. S. Chen, D. Donoho, and M. Saunders. Atomic decomposition by basis pursuit" SIAM Review, 43(1):129-159, 2001.
3. A. Bruckstein, D. Donoho, and M. Elad. "From sparse solutions of systems of equations to sparse modeling of signals and images". SIAM Review, 2007.
4. V. Chandrasekaran, B. Recht, P.A. Parrilo, and A.S. Willsky. "The convex algebraic geometry of linear inverse problems". In Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, pages 699-703, 2010.
5. S. Boyd and L. Vandenberghe, "Convex Optimization". Cambridge, U.K.: Cambridge Univ. Press, 2003.
6. A. Cohen and A. Yeredor, "On the use of sparsity for recovering discrete probability distributions from their moments". Statistical Signal Processing Workshop (SSP), 2011 IEEE
7. J. Kivinen and M.Warmuth. "Exponentiated gradient versus gradient descent for linear predictors". Information and Computation, 132(1):1-63, 1997.
8. D. Lashkari and P. Golland, "Convex clustering with exemplar-based models", in NIPS, 2008.