The convex algebraic geometry of linear inverse problems

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 699-703

  Chandrasekaran, Venkat ^a   Recht, Benjamin ^b   Parrilo, Pablo A ^a   Willsky, Alan S ^a  

^a USA   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC GEOMETRY; ALGEBRAIC STRUCTURES; ILL POSED; LINEAR COMBINATIONS; LINEAR INVERSE PROBLEMS; LINEAR MEASUREMENTS; LINEAR OBSERVATIONS; LOW-RANK MATRICES; ORTHOGONAL MATRIX; SPARSE VECTORS;

ALGEBRA; CONVEX OPTIMIZATION; DIFFERENTIAL EQUATIONS; MATRIX ALGEBRA; OPTIMIZATION; RECOVERY;

INVERSE PROBLEMS;

EID: 79952424894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706975     Document Type: Conference Paper

References (19)

1. Bochnak, J., Coste, M., and Roy, M. (1988). Real Algebraic Geometry. Springer.
2. Bonsall, F. F. (1991). A General Atomic Decomposition Theorem and Banach's Closed Range Theorem. The Quarterly Journal of Mathematics, 42(1):9-14.
3. CandèS, E. J., Romberg, J., and Tao, T. (2006). Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Info. Theory. 52 489-509.
4. Candès, E. J. and Recht, B. (2009). Exact matrix completion via convex optimization. Found. of Comput. Math.. 9 717-772.
5. De Silva, V. and Lim, L. (2008). Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM Journal on Matrix Analysis and Applications: Special Issue on Tensor Decompositions and Applications, 30(3), pp.10841127.
6. 1-norm solution is also the sparsest solution. Comm. on Pure and Applied Math.. 59 797-829.
7. Donoho, D. L. (2009). Compressed sensing. IEEE Trans. Info. Theory. 52 1289-1306.
8. Donoho, D. L. and Tanner, J. (2010). Counting the faces of randomly-projected hypercubes and orthants with applications. Discrete and Computational Geometry. 43 522-541.
9. Dudley, R. M. (1967). The sizes of compact subsets of Hilbert space and continuity of Gaussian processes. J. Functional Analysis 1: 290-330.
10. M. Fazel (2002). Matrix rank minimization with applications. PhD thesis, Dep. Elec. Eng., Stanford University.
11. n. Geometric aspects of functional analysis, Isr. Semin. 1986-87, Lect. Notes Math. 1317, 84-106.
12. Jagabathula, S. and Shah, D. (2010). Inferring Rankings Using Constrained Sensing. Preprint.
13. Ledoux, M. and Talagrand, M. (1991). Probability in Banach Spaces. Springer.
14. Mangasarian, O. and Recht, B. (2009). Probability of Unique Integer Solution to a System of Linear Equations. Preprint.
15. Parrilo, P. A. (2003). Semidefinite Programming Relaxations for Semialgebraic Problems. Mathematical Programming Ser. B, Vol. 96, No.2, pp. 293-320.
16. Recht, B., Fazel, M., and Parrilo, P. A. (2009). Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Review, to appear.
17. Rudelson, M. and Vershynin, R. (2006). Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. CISS 2006 (40th Annual Conference on Information Sciences and Systems).
18. Sanyal, R., Sottile, F., and Sturmfels, B. (2009) Orbitopes. Preprint.
19. Ziegler, G. (1995). Lectures on Polytopes. Springer.