{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:42:49Z","timestamp":1775641369466,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10208-018-9386-z","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T17:04:31Z","timestamp":1522170271000},"page":"375-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning Semidefinite Regularizers"],"prefix":"10.1007","volume":"19","author":[{"given":"Yong Sheng","family":"Soh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkat","family":"Chandrasekaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,27]]},"reference":[{"issue":"4","key":"9386_CR1","doi-asserted-by":"publisher","first-page":"2775","DOI":"10.1137\/140979861","volume":"26","author":"A Agarwal","year":"2016","unstructured":"Agarwal, A., Anandkumar, A., Jain, P., Netrapalli, P.: Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization. SIAM Journal on Optimization 26(4), 2775\u20132799 (2016). https:\/\/doi.org\/10.1137\/140979861","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"9386_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TIT.2016.2614684","volume":"63","author":"A Agarwal","year":"2017","unstructured":"Agarwal, A., Anandkumar, A., Netrapalli, P.: A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries. IEEE Transactions on Information Theory 63(1), 575\u2013592 (2017). https:\/\/doi.org\/10.1109\/TIT.2016.2614684","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"9386_CR3","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Transactions on Signal Processing 54(11), 4311\u20134322 (2006). https:\/\/doi.org\/10.1109\/TSP.2006.881199","journal-title":"IEEE Transactions on Signal Processing"},{"key":"9386_CR4","unstructured":"Arora, S., Ge, R., Ma, T., Moitra, A.: Simple, Efficient, and Neural Algorithms for Sparse Coding. In: Conference on Learning Theory (2015)"},{"key":"9386_CR5","first-page":"1","volume":"35","author":"S Arora","year":"2014","unstructured":"Arora, S., Ge, R., Moitra, A.: New Algorithms for Learning Incoherent and Overcomplete Dictionaries. Journal of Machine Learning Research: Workshop and Conference Proceedings 35, 1\u201328 (2014)","journal-title":"Journal of Machine Learning Research: Workshop and Conference Proceedings"},{"key":"9386_CR6","doi-asserted-by":"publisher","unstructured":"Barak, B., Kelner, J.A., Steurer, D.: Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746605","DOI":"10.1145\/2746539.2746605"},{"issue":"3","key":"9386_CR7","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"Barron, A.R.: Universal Approximation Bounds for Superpositions of a Sigmoidal Function. IEEE Transactions on Information Theory 39(3), 930\u2013945 (1993). https:\/\/doi.org\/10.1109\/18.256500","journal-title":"IEEE Transactions on Information Theory"},{"issue":"23","key":"9386_CR8","doi-asserted-by":"publisher","first-page":"5987","DOI":"10.1109\/TSP.2013.2273443","volume":"61","author":"BN Bhaskar","year":"2013","unstructured":"Bhaskar, B.N., Tang, G., Recht, B.: Atomic Norm Denoising with Applications to Line Spectral Estimation. IEEE Transactions on Signal Processing 61(23), 5987\u20135999 (2013)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"9386_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative Hard Thresholding for Compressed Sensing. Applied and Computational Harmonic Analysis 27, 265\u2013274 (2009). https:\/\/doi.org\/10.1016\/j.acha.2009.04.002","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"1","key":"9386_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images. SIAM Review 51(1), 34\u201381 (2009). https:\/\/doi.org\/10.1137\/060657704","journal-title":"SIAM Review"},{"key":"9386_CR11","doi-asserted-by":"publisher","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements. IEEE Transactions on Information Theory 57(4), 2342\u20132359. https:\/\/doi.org\/10.1109\/TIT.2011.2111771","DOI":"10.1109\/TIT.2011.2111771"},{"issue":"6","key":"9386_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact Matrix Completion via Convex Optimization. Foundations of Computational Mathematics 9(6), 717\u2013772 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"9386_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information. IEEE Transactions on Information Theory 52(2), 489\u2013509 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.862083","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"9386_CR14","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? IEEE Transactions on Information Theory 52(12), 5406\u20135425 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.885507","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9386_CR15","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parillo, P., Willsky, A.S.: Latent Variable Graphical Model Selection via Convex Optimization. The Annals of Statistics 40(4), 1935\u20131967 (2012). https:\/\/doi.org\/10.1214\/11-AOS949","journal-title":"The Annals of Statistics"},{"issue":"6","key":"9386_CR16","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.S.: The Convex Geometry of Linear Inverse Problems. Foundations of Computational Mathematics 12(6), 805\u2013849 (2012). https:\/\/doi.org\/10.1007\/s10208-012-9135-7","journal-title":"Foundations of Computational Mathematics"},{"issue":"1","key":"9386_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic Decomposition by Basis Pursuit. SIAM Journal on Scientific Computing 20(1), 33\u201361 (1998). https:\/\/doi.org\/10.1137\/S1064827596304010","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"9386_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.2991\/978-94-6239-009-6_2","volume":"9","author":"E Cho","year":"2013","unstructured":"Cho, E.: Inner Products of Random Vectors on $${S}^n$$ S n . Journal of Pure and Applied Mathematics: Advances and Applications 9(1), 63\u201368 (2013)","journal-title":"Journal of Pure and Applied Mathematics: Advances and Applications"},{"key":"9386_CR19","unstructured":"Cuturi, M.: Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances. In: Advances in Neural Information Processing Systems (2013)"},{"key":"9386_CR20","doi-asserted-by":"crossref","unstructured":"Davidson, K.R., Szarek, S.J.: Local Operator Theory, Random Matrices and Banach Spaces. In: W.B. Johnson, J.\u00a0Lindenstrauss (eds.) Handbook of the Geometry of Banach Spaces, chap.\u00a08, pp. 317\u2013366. Elsevier B. V. (2011)","DOI":"10.1016\/S1874-5849(01)80010-3"},{"issue":"1","key":"9386_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02124742","volume":"5","author":"RA DeVore","year":"1996","unstructured":"DeVore, R.A., Temlyakov, V.N.: Some Remarks on Greedy Algorithms. Advances in Computational Mathematics 5(1), 173\u2013187 (1996). https:\/\/doi.org\/10.1007\/BF02124742","journal-title":"Advances in Computational Mathematics"},{"issue":"4","key":"9386_CR22","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed Sensing. IEEE Transactions on Information Theory 52(4), 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"9386_CR23","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: For Most Large Underdetermined Systems of Linear Equations the Minimal $$\\ell _1$$ \u2113 1 -norm Solution Is Also the Sparsest Solution. Communications on Pure and Applied Mathematics 59(6), 797\u2013829 (2006). https:\/\/doi.org\/10.1002\/cpa.20132","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"9386_CR24","doi-asserted-by":"crossref","unstructured":"Donoho, D.L., Huo, X.: Uncertainty Principles and Ideal Atomic Decomposition. IEEE Transactions on Information Theory 47(7), 2845\u20132862","DOI":"10.1109\/18.959265"},{"key":"9386_CR25","doi-asserted-by":"publisher","unstructured":"Elad, M.: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer (2010). https:\/\/doi.org\/10.1007\/978-1-4419-7011-4","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"9386_CR26","unstructured":"Fazel, M.: Matrix Rank Minimization with Applications. Ph.D. thesis, Department of Electrical Engineering, Stanford University (2002)"},{"key":"9386_CR27","doi-asserted-by":"crossref","unstructured":"Fazel, M., Cand\u00e8s, E., Recht, B., Parrilo, P.: Compressed Sensing and Robust Recovery of Low Rank Matrices. In: 42nd IEEE Asilomar Conference on Signals, Systems and Computers (2008)","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"9386_CR28","doi-asserted-by":"publisher","unstructured":"Garg, A., Gurvits, L., Oliveira, R., Wigderson, A.: A Deterministic Polynomial Time Algorithm for Non-Commutative Rational Identity Testing with Applications. In: IEEE 57th Annual Symposium on Foundations of Computer Science (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.95","DOI":"10.1109\/FOCS.2016.95"},{"key":"9386_CR29","unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix Completion has No Spurious Local Minimum. In: Advances in Neural Information Processing Systems (2016)"},{"key":"9386_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10208-011-9084-6","volume":"11","author":"D Goldfarb","year":"2011","unstructured":"Goldfarb, D., Ma, S.: Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization. Foundations of Computational Mathematics 11, 183\u2013210 (2011). https:\/\/doi.org\/10.1007\/s10208-011-9084-6","journal-title":"Foundations of Computational Mathematics"},{"key":"9386_CR31","unstructured":"Gorman, W.M.: Estimating Trends in Leontief Matrices. Unplublished note, referenced in Bacharach (1970) (1963)"},{"issue":"2","key":"9386_CR32","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Lifts of Convex Sets and Cone Factorizations. Mathematics of Operations Research 38(2), 248\u2013264 (2013). https:\/\/doi.org\/10.1287\/moor.1120.0575","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"9386_CR33","doi-asserted-by":"publisher","first-page":"3469","DOI":"10.1109\/TIT.2015.2424238","volume":"61","author":"R Gribonval","year":"2015","unstructured":"Gribonval, R., Jenatton, R., Bach, F., Kleinsteuber, M., Seibert, M.: Sample Complexity of Dictionary Learning and Other Matrix Factorizations. IEEE Transactions on Information Theory 61(6), 3469\u20133486 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2424238","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"9386_CR34","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jcss.2004.06.003","volume":"69","author":"L Gurvits","year":"2004","unstructured":"Gurvits, L.: Classical Complexity and Quantum Entanglement. Journal of Computer and Systems Sciences 69(3), 448\u2013484 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2004.06.003","journal-title":"Journal of Computer and Systems Sciences"},{"key":"9386_CR35","doi-asserted-by":"crossref","unstructured":"Idel, M.: A Review of Matrix Scaling and Sinkhorn\u2019s Normal Form for Matrices and Positive Maps. CoRR arXiv:1609.06349 (2016)","DOI":"10.1016\/j.laa.2014.12.031"},{"key":"9386_CR36","unstructured":"Jain, P., Meka, R., Dhillon, I.S.: Guaranteed Rank Minimization via Singular Value Projection. In: Advances in Neural Information Processing Systems (2009)"},{"issue":"1","key":"9386_CR37","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1214\/aos\/1176348546","volume":"20","author":"LK Jones","year":"1992","unstructured":"Jones, L.K.: A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training. The Annals of Statistics 20(1), 608\u2013613 (1992). https:\/\/doi.org\/10.1214\/aos\/1176348546","journal-title":"The Annals of Statistics"},{"key":"9386_CR38","doi-asserted-by":"crossref","unstructured":"Kato, T.: Perturbation Theory for Linear Operators. Springer-Verlag (1966)","DOI":"10.1007\/978-3-642-53393-8"},{"issue":"4","key":"9386_CR39","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/0802034","volume":"2","author":"L Khachiyan","year":"1991","unstructured":"Khachiyan, L., Kalantari, B.: Diagonal Matrix Scaling and Linear Programming. SIAM Journal on Optimization 2(4), 668\u2013672 (1991). https:\/\/doi.org\/10.1137\/0802034","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"9386_CR40","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N Linial","year":"2000","unstructured":"Linial, N., Samorodnitsky, A., Wigderson, A.: A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Combinatorica 20(4), 545\u2013568 (2000). https:\/\/doi.org\/10.1007\/s004930070007","journal-title":"Combinatorica"},{"issue":"2\u20133","key":"9386_CR41","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1561\/0600000058","volume":"8","author":"J Mairal","year":"2014","unstructured":"Mairal, J., Bach, F., Ponce, J.: Sparse Modeling for Image and Vision Processing. Foundations and Trends in Computer Graphics and Vision 8(2\u20133), 85\u2013283 (2014). https:\/\/doi.org\/10.1561\/0600000058","journal-title":"Foundations and Trends in Computer Graphics and Vision"},{"issue":"4","key":"9386_CR42","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.2140\/pjm.1959.9.1215","volume":"9","author":"M Marcus","year":"1959","unstructured":"Marcus, M., Moyls, B.N.: Transformations on Tensor Product Spaces. Pacific Journal of Mathematics 9(4), 1215\u20131221 (1959)","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"9386_CR43","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1214\/009053606000000281","volume":"34","author":"N Meinhausen","year":"2006","unstructured":"Meinhausen, N., B\u00fchlmann, P.: High-Dimensional Graphs and Variable Selection with the Lasso. The Annals of Statistics 34(3), 1436\u20131462 (2006). https:\/\/doi.org\/10.1214\/009053606000000281","journal-title":"The Annals of Statistics"},{"issue":"2","key":"9386_CR44","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1993","unstructured":"Natarajan, B.K.: Sparse Approximate Solutions to Linear Systems. SIAM Journal on Computing 24(2), 227\u2013234 (1993). https:\/\/doi.org\/10.1137\/S0097539792240406","journal-title":"SIAM Journal on Computing"},{"key":"9386_CR45","doi-asserted-by":"publisher","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied and Numerical Mathematics (1994). https:\/\/doi.org\/10.1137\/1.9781611970791","DOI":"10.1137\/1.9781611970791"},{"key":"9386_CR46","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1038\/381607a0","volume":"381","author":"BA Olshausen","year":"1996","unstructured":"Olshausen, B.A., Field, D.J.: Emergence of Simple-Cell Receptive Field Properties by Learning a Sparse Code for Natural Images. Nature 381, 607\u2013609 (1996). https:\/\/doi.org\/10.1038\/381607a0","journal-title":"Nature"},{"issue":"4","key":"9386_CR47","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s10208-015-9278-4","volume":"16","author":"S Oymak","year":"2016","unstructured":"Oymak, S., Hassibi, B.: Sharp MSE Bounds for Proximal Denoising. Foundations of Computational Mathematics 16(4), 965\u20131029 (2016). https:\/\/doi.org\/10.1007\/s10208-015-9278-4","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"9386_CR48","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal Algorithms. Foundations and Trends in Optimization 1(3), 127\u2013239 (2014). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Foundations and Trends in Optimization"},{"key":"9386_CR49","unstructured":"Pisier, G.: Remarques sur un r\u00e9sultat non publi\u00e9 de B. Maurey. S\u00e9minaire Analyse fonctionnelle (dit \u201cMaurey-Schwartz\u201d) pp. 1\u201312 (1981)"},{"issue":"3","key":"9386_CR50","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization. SIAM Review 52(3), 471\u2013501 (2010). https:\/\/doi.org\/10.1137\/070697835","journal-title":"SIAM Review"},{"key":"9386_CR51","doi-asserted-by":"publisher","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MOS-SIAM Series on Optimization (2001). https:\/\/doi.org\/10.1137\/1.9780898718812","DOI":"10.1137\/1.9780898718812"},{"issue":"3","key":"9386_CR52","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.acha.2014.01.005","volume":"37","author":"K Schnass","year":"2014","unstructured":"Schnass, K.: On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD. Applied and Computational Harmonic Analysis 37(3), 464\u2013491 (2014). https:\/\/doi.org\/10.1016\/j.acha.2014.01.005","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"9386_CR53","doi-asserted-by":"publisher","unstructured":"Schnass, K.: Convergence Radius and Sample Complexity of ITKM Algorithms for Dictionary Learning. Applied and Computational Harmonic Analysis (2016). https:\/\/doi.org\/10.1016\/j.acha.2016.08.002","DOI":"10.1016\/j.acha.2016.08.002"},{"key":"9386_CR54","doi-asserted-by":"crossref","unstructured":"Shah, P., Bhaskar, B.N., Tang, G., Recht, B.: Linear System Identification via Atomic Norm Regularization. In: 51st IEEE Conference on Decisions and Control (2012)","DOI":"10.1109\/CDC.2012.6426006"},{"issue":"2","key":"9386_CR55","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R Sinkhorn","year":"1964","unstructured":"Sinkhorn, R.: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices. The Annals of Mathematical Statistics 35(2), 876\u2013879 (1964). https:\/\/doi.org\/10.1214\/aoms\/1177703591","journal-title":"The Annals of Mathematical Statistics"},{"issue":"37","key":"9386_CR56","first-page":"1","volume":"23","author":"DA Spielman","year":"2012","unstructured":"Spielman, D.A., Wang, H., Wright, J.: Exact Recovery of Sparsely-Used Dictionaries. Journal on Machine Learning and Research: Workshop and Conference Proceedings 23(37), 1\u201318 (2012)","journal-title":"Journal on Machine Learning and Research: Workshop and Conference Proceedings"},{"key":"9386_CR57","doi-asserted-by":"crossref","unstructured":"Stewart, G., Sun, J.: Matrix Perturbation Theory. Academic Press (1990)","DOI":"10.1137\/1032121"},{"key":"9386_CR58","doi-asserted-by":"publisher","unstructured":"Sun, J., Qu, Q., Wright, J.: A Geometric Analysis of Phase Retrieval. Foundations of Computational Mathematics (2017). https:\/\/doi.org\/10.1007\/s10208-017-9365-9","DOI":"10.1007\/s10208-017-9365-9"},{"issue":"2","key":"9386_CR59","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TIT.2016.2632162","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture. IEEE Transactions on Information Theory 63(2), 853\u2013884 (2017). https:\/\/doi.org\/10.1109\/TIT.2016.2632162","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"9386_CR60","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TIT.2016.2632149","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method. IEEE Transactions on Information Theory 63(2), 885\u2013914 (2017). https:\/\/doi.org\/10.1109\/TIT.2016.2632149","journal-title":"IEEE Transactions on Information Theory"},{"key":"9386_CR61","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1994","unstructured":"Tibshirani, R.: Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society, Series B 58, 267\u2013288 (1994)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"9386_CR62","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3 \u2013 a MATLAB Software Package for Semidefinite Programming. Optimization Methods and Software 11, 545\u2013581 (1999). https:\/\/doi.org\/10.1080\/10556789908805762","journal-title":"Optimization Methods and Software"},{"issue":"4","key":"9386_CR63","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-Friendly Tail Bounds for Sums of Random Matrices. Foundations of Computational Mathematics 12(4), 389\u2013434 (2012). https:\/\/doi.org\/10.1007\/s10208-011-9099-z","journal-title":"Foundations of Computational Mathematics"},{"key":"9386_CR64","doi-asserted-by":"publisher","unstructured":"Tun\u00e7el, L.: Potential Reduction and Primal-Dual Methods. In: H.\u00a0Wolkowicz, R.\u00a0Saigal, L.\u00a0Vandenberghe (eds.) Handbook of Semidefinite Programming \u2013 Theory, Algorithms, and Applications, chap.\u00a09. Kluwer\u2019s International Series in Operations Research and Management Science (2000). https:\/\/doi.org\/10.1007\/978-1-4615-4381-7","DOI":"10.1007\/978-1-4615-4381-7"},{"key":"9386_CR65","unstructured":"Vainsencher, D., Mannor, S., Bruckstein, A.M.: The sample complexity of dictionary learning. Journal of Machine Learning Research 12 (2011)"},{"key":"9386_CR66","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing Combinatorial Optimization Problems by Linear Programs. Journal of Computer and System Sciences 43, 441\u2013466 (1991). https:\/\/doi.org\/10.1016\/0022-0000(91)90024-Y","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-9386-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-018-9386-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-018-9386-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T10:59:32Z","timestamp":1719917972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-018-9386-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,27]]},"references-count":66,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9386"],"URL":"https:\/\/doi.org\/10.1007\/s10208-018-9386-z","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,27]]},"assertion":[{"value":"5 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}