{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:43:10Z","timestamp":1778859790717,"version":"3.51.4"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10208-012-9135-7","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T22:19:10Z","timestamp":1350512350000},"page":"805-849","source":"Crossref","is-referenced-by-count":779,"title":["The Convex Geometry of Linear Inverse Problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Venkat","family":"Chandrasekaran","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Recht","sequence":"additional","affiliation":[]},{"given":"Pablo A.","family":"Parrilo","sequence":"additional","affiliation":[]},{"given":"Alan S.","family":"Willsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"9135_CR1","series-title":"Advances in Pattern Recognition","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-299-3","volume-title":"Tensors in Image Processing and Computer Vision","author":"S. Aja-Fernandez","year":"2009","unstructured":"S. Aja-Fernandez, R. Garcia, D. Tao, X. Li, Tensors in Image Processing and Computer Vision. Advances in Pattern Recognition (Springer, Berlin, 2009)."},{"key":"9135_CR2","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/S0097539704441629","volume":"35","author":"N. Alon","year":"2006","unstructured":"N. Alon, A. Naor, Approximating the cut-norm via Grothendieck\u2019s inequality, SIAM J. Comput. 35, 787\u2013803 (2006).","journal-title":"SIAM J. Comput."},{"key":"9135_CR3","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"A. Barron","year":"1993","unstructured":"A. Barron, Universal approximation bounds for superpositions of a sigmoidal function, IEEE Trans. Inf. Theory 39, 930\u2013945 (1993).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR4","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/054","volume-title":"A\u00a0Course in Convexity","author":"A. Barvinok","year":"2002","unstructured":"A. Barvinok, A\u00a0Course in Convexity (American Mathematical Society, Providence, 2002)."},{"key":"9135_CR5","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.neuroimage.2004.10.043","volume":"25","author":"C. Beckmann","year":"2005","unstructured":"C. Beckmann, S. Smith, Tensorial extensions of independent component analysis for multisubject FMRI analysis, NeuroImage 25, 294\u2013311 (2005).","journal-title":"NeuroImage"},{"key":"9135_CR6","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D. Bertsekas","year":"2007","unstructured":"D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods (Athena Scientific, Nashua, 2007)."},{"key":"9135_CR7","volume-title":"Convex Analysis and Optimization","author":"D. Bertsekas","year":"2003","unstructured":"D. Bertsekas, A. Nedic, A. Ozdaglar, Convex Analysis and Optimization (Athena Scientific, Nashua, 2003)."},{"key":"9135_CR8","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"P. Bickel","year":"2009","unstructured":"P. Bickel, Y. Ritov, A. Tsybakov, Simultaneous analysis of Lasso and Dantzig selector, Ann. Stat. 37, 1705\u20131732 (2009).","journal-title":"Ann. Stat."},{"key":"9135_CR9","volume-title":"Real Algebraic Geometry","author":"J. Bochnak","year":"1988","unstructured":"J. Bochnak, M. Coste, M. Roy, Real Algebraic Geometry (Springer, Berlin, 1988)."},{"key":"9135_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1093\/qmath\/42.1.9","volume":"42","author":"F.F. Bonsall","year":"1991","unstructured":"F.F. Bonsall, A general atomic decomposition theorem and Banach\u2019s closed range theorem, Q. J. Math. 42, 9\u201314 (1991).","journal-title":"Q. J. Math."},{"key":"9135_CR11","first-page":"244","volume-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science","author":"A. Brieden","year":"1998","unstructured":"A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovasz, M. Simonovits, Approximation of diameters: randomization doesn\u2019t help, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science (1998), pp. 244\u2013251."},{"key":"9135_CR12","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J. Cai","year":"2008","unstructured":"J. Cai, E. Cand\u00e8s, Z. Shen, A singular value thresholding algorithm for matrix completion, SIAM J. Optim. 20, 1956\u20131982 (2008).","journal-title":"SIAM J. Optim."},{"key":"9135_CR13","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1090\/S0025-5718-08-02189-3","volume":"78","author":"J. Cai","year":"2009","unstructured":"J. Cai, S. Osher, Z. Shen, Linearized Bregman iterations for compressed sensing, Math. Comput. 78, 1515\u20131536 (2009).","journal-title":"Math. Comput."},{"key":"9135_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"E. Cand\u00e8s","year":"2011","unstructured":"E. Cand\u00e8s, X. Li, Y. Ma, J. Wright, Robust principal component analysis? J. ACM 58, 1\u201337 (2011).","journal-title":"J. ACM"},{"key":"9135_CR15","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"E. Cand\u00e8s","year":"2011","unstructured":"E. Cand\u00e8s, Y. Plan, Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements, IEEE Trans. Inf. Theory 57, 2342\u20132359 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"E.J. Cand\u00e8s, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory 52, 489\u2013509 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR17","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Cand\u00e8s","year":"2009","unstructured":"E.J. Cand\u00e8s, B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math. 9, 717\u2013772 (2009).","journal-title":"Found. Comput. Math."},{"key":"9135_CR18","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E. Cand\u00e8s","year":"2005","unstructured":"E. Cand\u00e8s, T. Tao, Decoding by linear programming, IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR19","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V. Chandrasekaran","year":"2011","unstructured":"V. Chandrasekaran, S. Sanghavi, P.A. Parrilo, A.S. Willsky, Rank-sparsity incoherence for matrix decomposition, SIAM J. Optim. 21, 572\u2013596 (2011).","journal-title":"SIAM J. Optim."},{"key":"9135_CR20","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P. Combettes","year":"2005","unstructured":"P. Combettes, V. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul. 4, 1168\u20131200 (2005).","journal-title":"Multiscale Model. Simul."},{"key":"9135_CR21","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"LVII","author":"I. Daubechies","year":"2004","unstructured":"I. Daubechies, M. Defriese, C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Commun. Pure Appl. Math. LVII, 1413\u20131457 (2004).","journal-title":"Commun. Pure Appl. Math."},{"key":"9135_CR22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S1874-5849(01)80010-3","volume-title":"Handbook of the Geometry of Banach Spaces","author":"K.R. Davidson","year":"2001","unstructured":"K.R. Davidson, S.J. Szarek, Local operator theory, random matrices and Banach spaces, in Handbook of the Geometry of Banach Spaces, vol.\u00a0I (2001), pp.\u00a0317\u2013366."},{"key":"9135_CR23","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V. Silva de","year":"2008","unstructured":"V. de Silva, L. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl. 30, 1084\u20131127 (2008).","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9135_CR24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02124742","volume":"5","author":"R. DeVore","year":"1996","unstructured":"R. DeVore, V. Temlyakov, Some remarks on greedy algorithms, Adv. Comput. Math. 5, 173\u2013187 (1996).","journal-title":"Adv. Comput. Math."},{"key":"9135_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M. Deza","year":"1997","unstructured":"M. Deza, M. Laurent, Geometry of Cuts and Metrics (Springer, Berlin, 1997)."},{"key":"9135_CR26","doi-asserted-by":"crossref","unstructured":"D.L. Donoho, High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension, Discrete Comput. Geom. (online) (2005).","DOI":"10.1007\/s00454-005-1220-0"},{"key":"9135_CR27","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D.L. Donoho","year":"2006","unstructured":"D.L. Donoho, For most large underdetermined systems of linear equations the minimal \u2113 1-norm solution is also the sparsest solution, Commun. Pure Appl. Math. 59, 797\u2013829 (2006).","journal-title":"Commun. Pure Appl. Math."},{"key":"9135_CR28","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"D.L. Donoho, Compressed sensing, IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR29","doi-asserted-by":"crossref","first-page":"9446","DOI":"10.1073\/pnas.0502269102","volume":"102","author":"D. Donoho","year":"2005","unstructured":"D. Donoho, J. Tanner, Sparse nonnegative solution of underdetermined linear equations by linear programming, Proc. Natl. Acad. Sci. USA 102, 9446\u20139451 (2005).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9135_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0894-0347-08-00600-0","volume":"22","author":"D. Donoho","year":"2009","unstructured":"D. Donoho, J. Tanner, Counting faces of randomly-projected polytopes when the projection radically lowers dimension, J. Am. Math. Soc. 22, 1\u201353 (2009).","journal-title":"J. Am. Math. Soc."},{"key":"9135_CR31","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/s00454-009-9221-z","volume":"43","author":"D. Donoho","year":"2010","unstructured":"D. Donoho, J. Tanner, Counting the faces of randomly-projected hypercubes and orthants with applications, Discrete Comput. Geom. 43, 522\u2013541 (2010).","journal-title":"Discrete Comput. Geom."},{"key":"9135_CR32","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-1236(67)90017-1","volume":"1","author":"R.M. Dudley","year":"1967","unstructured":"R.M. Dudley, The sizes of compact subsets of Hilbert space and continuity of Gaussian processes, J.\u00a0Funct. Anal. 1, 290\u2013330 (1967).","journal-title":"J.\u00a0Funct. Anal."},{"key":"9135_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M. Dyer","year":"1991","unstructured":"M. Dyer, A. Frieze, R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM 38, 1\u201317 (1991).","journal-title":"J. ACM"},{"key":"9135_CR34","unstructured":"M. Fazel, Matrix rank minimization with applications, Ph.D. thesis, Department of Electrical Engineering, Stanford University (2002)."},{"key":"9135_CR35","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1109\/TIP.2003.814255","volume":"12","author":"M. Figueiredo","year":"2003","unstructured":"M. Figueiredo, R. Nowak, An EM algorithm for wavelet-based image restoration, IEEE Trans. Image Process. 12, 906\u2013916 (2003).","journal-title":"IEEE Trans. Image Process."},{"key":"9135_CR36","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M. Fukushima","year":"1981","unstructured":"M. Fukushima, H. Mine, A generalized proximal point algorithm for certain non-convex minimization problems, Int. J. Inf. Syst. Sci. 12, 989\u20131000 (1981).","journal-title":"Int. J. Inf. Syst. Sci."},{"key":"9135_CR37","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"M. Goemans, D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42, 1115\u20131145 (1995).","journal-title":"J. ACM"},{"key":"9135_CR38","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BFb0081737","volume-title":"Geometric Aspects of Functional Analysis, Israel Seminar 1986\u20131987","author":"Y. Gordon","year":"1988","unstructured":"Y. Gordon, On Milman\u2019s inequality and random subspaces which escape through a mesh in \u211d n , in Geometric Aspects of Functional Analysis, Israel Seminar 1986\u20131987. Lecture Notes in Mathematics, vol.\u00a01317 (1988), pp. 84\u2013106."},{"key":"9135_CR39","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J. Gouveia","year":"2010","unstructured":"J. Gouveia, P. Parrilo, R. Thomas, Theta bodies for polynomial ideals, SIAM J. Optim. 20, 2097\u20132118 (2010).","journal-title":"SIAM J. Optim."},{"key":"9135_CR40","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"T. Hale","year":"2008","unstructured":"T. Hale, W. Yin, Y. Zhang, A fixed-point continuation method for \u2113 1-regularized minimization: methodology and convergence, SIAM J. Optim. 19, 1107\u20131130 (2008).","journal-title":"SIAM J. Optim."},{"key":"9135_CR41","unstructured":"J. Harris, Algebraic Geometry: A First Course (Springer, Berlin)."},{"issue":"11","key":"9135_CR42","doi-asserted-by":"crossref","first-page":"5862","DOI":"10.1109\/TIT.2010.2070191","volume":"56","author":"J. Haupt","year":"2010","unstructured":"J. Haupt, W.U. Bajwa, G. Raz, R. Nowak, Toeplitz compressed sensing matrices with applications to sparse channel estimation, IEEE Trans. Inform. Theory 56(11), 5862\u20135875 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9135_CR43","doi-asserted-by":"crossref","first-page":"7288","DOI":"10.1109\/TIT.2011.2165827","volume":"57","author":"S. Jagabathula","year":"2011","unstructured":"S. Jagabathula, D. Shah, Inferring rankings using constrained sensing, IEEE Trans. Inf. Theory 57, 7288\u20137306 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9135_CR44","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"L. Jones","year":"1992","unstructured":"L. Jones, A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training, Ann. Stat. 20, 608\u2013613 (1992).","journal-title":"Ann. Stat."},{"key":"9135_CR45","volume-title":"Introduction to Geometric Probability","author":"D. Klain","year":"1997","unstructured":"D. Klain, G. Rota, Introduction to Geometric Probability (Cambridge University Press, Cambridge, 1997)."},{"key":"9135_CR46","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S0895479800368354","volume":"23","author":"T. Kolda","year":"2001","unstructured":"T. Kolda, Orthogonal tensor decompositions, SIAM J. Matrix Anal. Appl. 23, 243\u2013255 (2001).","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9135_CR47","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T. Kolda","year":"2009","unstructured":"T. Kolda, B. Bader, Tensor decompositions and applications, SIAM Rev. 51, 455\u2013500 (2009).","journal-title":"SIAM Rev."},{"key":"9135_CR48","volume-title":"The Concentration of Measure Phenomenon","author":"M. Ledoux","year":"2000","unstructured":"M. Ledoux, The Concentration of Measure Phenomenon (American Mathematical Society, Providence, 2000)."},{"key":"9135_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces","author":"M. Ledoux","year":"1991","unstructured":"M. Ledoux, M. Talagrand, Probability in Banach Spaces (Springer, Berlin, 1991)."},{"key":"9135_CR50","volume-title":"Proceedings of the CACSD Conference","author":"J. L\u00f6fberg","year":"2004","unstructured":"J. L\u00f6fberg, YALMIP: A toolbox for modeling and optimization in MATLAB, in Proceedings of the CACSD Conference, Taiwan (2004). Available from http:\/\/control.ee.ethz.ch\/~joloef\/yalmip.php ."},{"key":"9135_CR51","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S. Ma","year":"2011","unstructured":"S. Ma, D. Goldfarb, L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Math. Program. 128, 321\u2013353 (2011).","journal-title":"Math. Program."},{"key":"9135_CR52","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2011.04.010","volume":"214","author":"O. Mangasarian","year":"2011","unstructured":"O. Mangasarian, B. Recht, Probability of unique integer solution to a system of linear equations, Eur. J. Oper. Res. 214, 27\u201330 (2011).","journal-title":"Eur. J. Oper. Res."},{"key":"9135_CR53","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"J. Matou\u0161ek, Lectures on Discrete Geometry (Springer, Berlin, 2002)."},{"key":"9135_CR54","unstructured":"S. Negahban, P. Ravikumar, M. Wainwright, B. Yu, A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers, Preprint (2010)."},{"key":"9135_CR55","unstructured":"Y. Nesterov, Quality of semidefinite relaxation for nonconvex quadratic optimization. Technical report (1997)."},{"key":"9135_CR56","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y. Nesterov","year":"2004","unstructured":"Y. Nesterov, Introductory Lectures on Convex Optimization (Kluwer Academic, Amsterdam, 2004)."},{"key":"9135_CR57","unstructured":"Y. Nesterov, Gradient methods for minimizing composite functions, CORE discussion paper 76 (2007)."},{"key":"9135_CR58","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P.A. Parrilo","year":"2003","unstructured":"P.A. Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. 96, 293\u2013320 (2003).","journal-title":"Math. Program."},{"key":"9135_CR59","series-title":"S\u00e9minaire d\u2019analyse fonctionnelle","volume-title":"Remarques sur un r\u00e9sultat non publi\u00e9 de B. Maurey","author":"G. Pisier","year":"1981","unstructured":"G. Pisier, Remarques sur un r\u00e9sultat non publi\u00e9 de B. Maurey. S\u00e9minaire d\u2019analyse fonctionnelle (Ecole Polytechnique Centre de Mathematiques, Palaiseau, 1981)."},{"key":"9135_CR60","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0076302","volume-title":"Probability and Analysis","author":"G. Pisier","year":"1986","unstructured":"G. Pisier, Probabilistic methods in the geometry of Banach spaces, in Probability and Analysis, pp.\u00a0167\u2013241 (1986)."},{"key":"9135_CR61","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0663-7","volume-title":"Optimization: Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"E. Polak, Optimization: Algorithms and Consistent Approximations (Springer, Berlin, 1997)."},{"key":"9135_CR62","volume-title":"Proceedings of SPARS\u201909","author":"H. Rauhut","year":"2009","unstructured":"H. Rauhut, Circulant and Toeplitz matrices in compressed sensing, in Proceedings of SPARS\u201909, (2009)."},{"key":"9135_CR63","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B. Recht","year":"2010","unstructured":"B. Recht, M. Fazel, P.A. Parrilo, Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization, SIAM Rev. 52, 471\u2013501 (2010).","journal-title":"SIAM Rev."},{"key":"9135_CR64","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0422-2","volume":"127","author":"B. Recht","year":"2011","unstructured":"B. Recht, W. Xu, B. Hassibi, Null space conditions and thresholds for rank minimization, Math. Program., Ser. B 127, 175\u2013211 (2011).","journal-title":"Math. Program., Ser. B"},{"key":"9135_CR65","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, 1970)."},{"key":"9135_CR66","volume-title":"CISS 2006 (40th Annual Conference on Information Sciences and Systems)","author":"M. Rudelson","year":"2006","unstructured":"M. Rudelson, R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements, in CISS 2006 (40th Annual Conference on Information Sciences and Systems) (2006)."},{"key":"9135_CR67","unstructured":"R. Sanyal, F. Sottile, B. Sturmfels, Orbitopes, Preprint, arXiv:0911.5436 (2009)."},{"key":"9135_CR68","volume-title":"18th Annual Conference on Learning Theory (COLT)","author":"N. Srebro","year":"2005","unstructured":"N. Srebro, A. Shraibman, Rank, trace-norm and max-norm in 18th Annual Conference on Learning Theory (COLT) (2005)."},{"key":"9135_CR69","unstructured":"M. Stojnic, Various thresholds for \u2113 1-optimization in compressed sensing, Preprint, arXiv:0907.3666 (2009)."},{"key":"9135_CR70","unstructured":"K. Toh, M. Todd, R. Tutuncu, SDPT3\u2014a MATLAB software package for semidefinite-quadratic-linear programming. Available from. http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html ."},{"key":"9135_CR71","first-page":"615","volume":"6","author":"K. Toh","year":"2010","unstructured":"K. Toh, S. Yun, An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems, Pac. J. Optim. 6, 615\u2013640 (2010).","journal-title":"Pac. J. Optim."},{"key":"9135_CR72","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1214\/09-EJS506","volume":"3","author":"S. Geer van de","year":"2009","unstructured":"S. van de Geer, P. B\u00fchlmann, On the conditions used to prove oracle results for the Lasso, Electron. J. Stat. 3, 1360\u20131392 (2009).","journal-title":"Electron. J. Stat."},{"key":"9135_CR73","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"S. Wright","year":"2009","unstructured":"S. Wright, R. Nowak, M. Figueiredo, Sparse reconstruction by separable approximation, IEEE Trans. Signal Process. 57, 2479\u20132493 (2009).","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"9135_CR74","doi-asserted-by":"crossref","first-page":"6894","DOI":"10.1109\/TIT.2011.2165825","volume":"57","author":"W. Xu","year":"2011","unstructured":"W. Xu, B. Hassibi, Compressive sensing over the Grassmann manifold: a unified geometric framework, IEEE Trans. Inform. Theory 57(10), 6894\u20136919 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9135_CR75","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W. Yin","year":"2008","unstructured":"W. Yin, S. Osher, J. Darbon, D. Goldfarb, Bregman iterative algorithms for compressed sensing and related problems, SIAM J. Imaging Sci. 1, 143\u2013168 (2008).","journal-title":"SIAM J. Imaging Sci."},{"key":"9135_CR76","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G. Ziegler","year":"1995","unstructured":"G. Ziegler, Lectures on Polytopes (Springer, Berlin, 1995)."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-012-9135-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-012-9135-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-012-9135-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T19:52:34Z","timestamp":1562269954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-012-9135-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":76,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9135"],"URL":"https:\/\/doi.org\/10.1007\/s10208-012-9135-7","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,16]]}}}