{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:14:30Z","timestamp":1759666470120,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T00:00:00Z","timestamp":1504656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T00:00:00Z","timestamp":1504656000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1350590"],"award-info":[{"award-number":["CCF-1350590"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-14-1-0098"],"award-info":[{"award-number":["FA9550-14-1-0098"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-16-1-0210"],"award-info":[{"award-number":["FA9550-16-1-0210"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10107-017-1187-7","type":"journal-article","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T21:58:09Z","timestamp":1504735089000},"page":"129-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Interpreting latent variables in factor models via convex optimization"],"prefix":"10.1007","volume":"167","author":[{"given":"Armeen","family":"Taeb","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":[[2017,9,6]]},"reference":[{"key":"1187_CR1","volume-title":"Mathematical Statistics, Basic Ideas and Selected Topics","author":"P Bickel","year":"2007","unstructured":"Bickel, P., Doksum, K.: Mathematical Statistics, Basic Ideas and Selected Topics. Prentice-Hall, Prentice (2007)"},{"key":"1187_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for High-Dimensional Data","author":"P B\u00fchlmann","year":"2011","unstructured":"B\u00fchlmann, P., van de Geer, S.: Statistics for High-Dimensional Data. Springer, New York (2011)"},{"key":"1187_CR3","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. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"1187_CR4","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1198\/016214508000000869","volume":"103","author":"C Cavalho","year":"2008","unstructured":"Cavalho, C., Chang, J., Lucas, J., Nevins, J., Wang, Q., West, M.: High-dimensional sparse factor modeling: applications in gene expression genomics. J. Am. Stat. Assoc. 103, 1438\u20131456 (2008)","journal-title":"J. Am. Stat. Assoc."},{"key":"1187_CR5","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21, 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"key":"1187_CR6","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parrilo, P.A., Willsky, A.S.: Latent variable graphical model selection via convex optimization. Ann. Stat. 40, 1935\u20131967 (2012)","journal-title":"Ann. Stat."},{"key":"1187_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S1874-5849(01)80010-3","volume":"1","author":"KR Davidson","year":"2001","unstructured":"Davidson, K.R., Szarek, S.J.: Local operator theory, random matrices and Banach spaces. Handb. Geom. Banach Spaces 1, 317\u2013366 (2001)","journal-title":"Handb. Geom. Banach Spaces"},{"key":"1187_CR8","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Department of Electrical Engineering, Stanford University (2002)"},{"key":"1187_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/biomet\/28.3-4.321","volume":"28","author":"H Hotelling","year":"2002","unstructured":"Hotelling, H.: Relations between two sets of variants. Biometrika 28, 321\u2013377 (2002)","journal-title":"Biometrika"},{"key":"1187_CR10","volume-title":"Modern Spectral Estimation, Theory and Application","author":"SM Kay","year":"1988","unstructured":"Kay, S.M.: Modern Spectral Estimation, Theory and Application. Prentice-Hall, Prentice (1988)"},{"key":"1187_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0370164600020010","volume":"60","author":"W Ledermann","year":"1940","unstructured":"Ledermann, W.: On a problem concerning matrices with variable diagonal elements. Proc. R. Soc. Edinb. 60, 1\u201317 (1940)","journal-title":"Proc. R. Soc. Edinb."},{"key":"1187_CR12","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1214\/009053606000000281","volume":"34","author":"N Meinhausen","year":"2006","unstructured":"Meinhausen, N., B\u00fclmann, A.P.: High dimensional graphs and variable selection with the Lasso. Ann. Stat. 34, 1436\u20131462 (2006)","journal-title":"Ann. Stat."},{"key":"1187_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/9.554402","volume":"42","author":"M Mesbahi","year":"1997","unstructured":"Mesbahi, M., Papavassilopoulos, G.: On the rank minimization problem over a positive semidefinite linear matrix inequality. IEEE Trans. Autom. Control 42, 239\u2013243 (1997)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1187_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"1187_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1214\/11-EJS631","volume":"4","author":"P Ravikumar","year":"2011","unstructured":"Ravikumar, P., Wainwright, M.J., Raskutti, G., Yu, B.: High-dimensional covariance estimation by minimizing $$\\ell _1$$-penalized log-determinant divergence. Electron. J. Stat. 4, 935\u2013980 (2011)","journal-title":"Electron. J. Stat."},{"key":"1187_CR16","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 to linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1187_CR17","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/120872516","volume":"33","author":"J Saunderson","year":"2012","unstructured":"Saunderson, J., Chandrasekaran, V., Parrillo, P., Willsky, S.: Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting. SIAM J. Matrix Anal. 33, 1395\u20131416 (2012)","journal-title":"SIAM J. Matrix Anal."},{"key":"1187_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02296274","volume":"47","author":"A Shapiro","year":"1982","unstructured":"Shapiro, A.: Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis. Psychometrika 47, 187\u2013199 (1982)","journal-title":"Psychometrika"},{"key":"1187_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02294158","volume":"47","author":"A Shapiro","year":"1982","unstructured":"Shapiro, A.: Weighted minimum trace factor analysis. Psychometrika 47, 243\u2013264 (1982)","journal-title":"Psychometrika"},{"key":"1187_CR20","first-page":"201","volume":"15","author":"A Shapiro","year":"1904","unstructured":"Shapiro, A.: Identifiability of factor analysis: some results and open problems. Linear Algebra Appl. 15, 201\u2013292 (1904)","journal-title":"Linear Algebra Appl."},{"key":"1187_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.2307\/1412107","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman, C.: \u2018General intelligence\u2019, objectively determined and measured. Am. J. Psychol. 15, 201\u2013292 (1904)","journal-title":"Am. J. Psychol."},{"key":"1187_CR22","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2014a MATLAB software package for semidefinite-quadratic-linear programming. \n                    http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html"},{"key":"1187_CR23","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","volume":"55","author":"MJ Wainwright","year":"2009","unstructured":"Wainwright, M.J.: Sharp thresholds for noisy and high-dimensional recovery of sparsity using $$\\ell _1$$-constrained quadratic programming (Lasso). IEEE Trans. Inf. Theory 55, 2183\u20132202 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1187_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1146\/annurev-statistics-022513-115643","volume":"1","author":"MJ Wainwright","year":"2014","unstructured":"Wainwright, M.J.: Structured regularizers for high-dimensional problems: statistical and computational issues. Annu. Rev. Stat. Appl. 1, 233\u2013253 (2014)","journal-title":"Annu. Rev. Stat. Appl."},{"key":"1187_CR25","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao, P., Yu, B.: On model selection consistency of the lasso. J. Mach. Learn. Res. 7, 2541\u20132567 (2006)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1187-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1187-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:24:20Z","timestamp":1589646260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1187-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1187"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1187-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,9,6]]},"assertion":[{"value":"2 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}