{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:44:42Z","timestamp":1759041882055},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,3,14]],"date-time":"2020-03-14T00:00:00Z","timestamp":1584144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,14]],"date-time":"2020-03-14T00:00:00Z","timestamp":1584144000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11222-020-09939-5","type":"journal-article","created":{"date-parts":[[2020,3,14]],"date-time":"2020-03-14T13:02:36Z","timestamp":1584190956000},"page":"1113-1138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Matrix completion with nonconvex regularization: spectral operators and scalable algorithms"],"prefix":"10.1007","volume":"30","author":[{"given":"Rahul","family":"Mazumder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Saldana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haolei","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,14]]},"reference":[{"issue":"1","key":"9939_CR1","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1214\/15-EJS1020","volume":"9","author":"P Alquier","year":"2015","unstructured":"Alquier, P.: A bayesian approach for noisy matrix completion: optimal rate under general sampling distribution. Electron. J. Stat. 9(1), 823\u2013841 (2015)","journal-title":"Electron. J. Stat."},{"key":"9939_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-0661-8","volume-title":"Spectral Analysis of Large Dimensional Random Matrices","author":"Z Bai","year":"2010","unstructured":"Bai, Z., Silverstein, J.W.: Spectral Analysis of Large Dimensional Random Matrices. Springer, Berlin (2010)"},{"issue":"2","key":"9939_CR3","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"9939_CR4","unstructured":"Bhojanapalli, S., Neyshabur, B., Srebro, N.: Global optimality of local search for low rank matrix recovery. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 3873\u20133881 (2016)"},{"key":"9939_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization","author":"J Borwein","year":"2006","unstructured":"Borwein, J., Lewis, A.: Convex Analysis and Nonlinear Optimization. Springer, New York (2006)"},{"key":"9939_CR6","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9939_CR7","doi-asserted-by":"crossref","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":"9939_CR8","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98, 925\u2013936 (2010a)","journal-title":"Proc. IEEE"},{"key":"9939_CR9","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053\u20132080 (2010b)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5\u20136","key":"9939_CR10","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"19","key":"9939_CR11","doi-asserted-by":"crossref","first-page":"4643","DOI":"10.1109\/TSP.2013.2270464","volume":"61","author":"E Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E., Sing-Long, C., Trzasko, J.D.: Unbiased risk estimates for singular value thresholding and spectral estimators. IEEE Trans.Signal Process. 61(19), 4643\u20134657 (2013)","journal-title":"IEEE Trans.Signal Process."},{"key":"9939_CR12","unstructured":"Chen, Y., Bhojanapalli, S., Sanghavi, S., Ward, R.: Coherent matrix completion. In: Proceedings of the 31st International Conference on Machine Learning, JMLR, pp. 674\u2013682 (2014)"},{"issue":"5","key":"9939_CR13","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.1109\/TIT.2015.2415195","volume":"61","author":"Y Chen","year":"2015","unstructured":"Chen, Y.: Incoherence-optimal matrix completion. IEEE Trans. Inf. Theory 61(5), 2909\u20132923 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9939_CR14","unstructured":"Chen, Y., Wainwright, M.J.: Fast low-rank estimation by projected gradient descent: general statistical and algorithmic guarantees (2015). arXiv preprint arXiv:1509.03025"},{"key":"9939_CR15","unstructured":"Chen, J., Liu, D., Li, X.: Nonconvex rectangular matrix completion via gradient descent without $$\\ell _{2,\\infty }$$ regularization (2019a). arXiv preprint arXiv:1901.06116"},{"key":"9939_CR16","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C., Yan, Y.: Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization (2019b). arXiv preprint arXiv:1902.07698","DOI":"10.1137\/19M1290000"},{"issue":"20","key":"9939_CR17","doi-asserted-by":"crossref","first-page":"5239","DOI":"10.1109\/TSP.2019.2937282","volume":"67","author":"Y Chi","year":"2019","unstructured":"Chi, Y., Lu, Y.M., Chen, Y.: Nonconvex optimization meets low-rank matrix factorization: an overview. IEEE Trans. Signal Process. 67(20), 5239\u20135269 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"9939_CR18","doi-asserted-by":"crossref","unstructured":"Chistov, A.L., Grigor\u2019ev, D.Y.: Complexity of quantifier elimination in the theory of algebraically closed fields. In: Proceedings of the 11th International Symposium on Mathematical Foundations of Computer Science, pp. 17\u201331. Springer (1984)","DOI":"10.1007\/BFb0030287"},{"issue":"1","key":"9939_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci."},{"key":"9939_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. J. R. Stat. Soc. B 39, 1\u201338 (1977)","journal-title":"J. R. Stat. Soc. B"},{"issue":"2","key":"9939_CR21","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression (with discussion). Ann. Stat. 32(2), 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"9939_CR22","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"9939_CR23","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University (2002)"},{"key":"9939_CR24","unstructured":"Feng, L., Zhang, C.H.: Sorted concave penalized regression (2017). arXiv preprint arXiv:1712.09941"},{"issue":"4","key":"9939_CR25","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1137\/100811404","volume":"21","author":"M Fornasier","year":"2011","unstructured":"Fornasier, M., Rauhut, H., Ward, R.: Low-rank matrix recovery via iteratively reweighted least squares minimization. SIAM J. Optim. 21(4), 1614\u20131640 (2011)","journal-title":"SIAM J. Optim."},{"key":"9939_CR26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/00401706.1993.10485033","volume":"35","author":"IE Frank","year":"1993","unstructured":"Frank, I.E., Friedman, J.H.: A statistical view of some chemometrics regression tools. Technometrics 35, 109\u2013135 (1993)","journal-title":"Technometrics"},{"key":"9939_CR27","unstructured":"Freund, R.M., Grigas, P., Mazumder, R.: An extended Frank-Wolfe method with \u201cIn-Face\u201d directions, and its application to low-rank matrix completion (2015). arXiv e-prints arXiv:1511.02204"},{"key":"9939_CR28","unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix completion has no spurious local minimum. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 2973\u20132981 (2016)"},{"key":"9939_CR29","unstructured":"Ge, R., Jin, C., Zheng, Y.: No spurious local minima in nonconvex low rank problems: a unified geometric analysis. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, JMLR. org, pp. 1233\u20131242 (2017)"},{"key":"9939_CR30","volume-title":"Matrix Computations","author":"G Golub","year":"1983","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins University Press, Baltimore (1983)"},{"issue":"3","key":"9939_CR31","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9939_CR32","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., Zhang, L.: Weighted nuclear norm minimization and its applications to low level vision. Int. J. Comput. Vis. 121(2), 183\u2013208 (2017)","journal-title":"Int. J. Comput. Vis."},{"key":"9939_CR33","doi-asserted-by":"crossref","unstructured":"Hardt, M.: Understanding alternating minimization for matrix completion. In: IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 651\u2013660. IEEE (2014)","DOI":"10.1109\/FOCS.2014.75"},{"key":"9939_CR34","unstructured":"Hardt, M., Wootters, M.: Fast matrix completion without the condition number. In: Conference on Learning Theory, pp. 638\u2013678 (2014)"},{"key":"9939_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Prediction, Inference and Data Mining","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Prediction, Inference and Data Mining, 2nd edn. Springer, New York (2009)","edition":"2"},{"issue":"1","key":"9939_CR36","first-page":"3367","volume":"16","author":"T Hastie","year":"2016","unstructured":"Hastie, T., Mazumder, R., Lee, J.D., Zadeh, R.: Matrix completion and low-rank SVD via fast alternating least squares. J. Mach. Learn. Res. 16(1), 3367\u20133402 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR37","doi-asserted-by":"crossref","unstructured":"Hazimeh, H., Mazumder, R.: Fast best subset selection: coordinate descent and local combinatorial optimization algorithms. Oper. Res. (2019) (accepted)","DOI":"10.1287\/opre.2019.1919"},{"key":"9939_CR38","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"9939_CR39","unstructured":"Jaggi, M., Sulovsk\u00fd, M.: A simple algorithm for nuclear norm regularized problems. In: Proceedings of the 27th International Conference on Machine Learning (ICML-10), pp. 471\u2013478 (2010)"},{"key":"9939_CR40","unstructured":"Jain, P., Meka, R., Dhillon, I.S.: Guaranteed rank minimization via singular value projection. In: Advances in Neural Information Processing Systems, pp. 937\u2013945 (2010)"},{"key":"9939_CR41","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 665\u2013674. ACM (2013)","DOI":"10.1145\/2488608.2488693"},{"key":"9939_CR42","first-page":"2057","volume":"11","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057\u20132078 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9939_CR43","doi-asserted-by":"crossref","first-page":"282","DOI":"10.3150\/12-BEJ486","volume":"20","author":"O Klopp","year":"2014","unstructured":"Klopp, O.: Noisy low-rank matrix completion with general sampling distribution. Bernoulli 20(1), 282\u2013303 (2014)","journal-title":"Bernoulli"},{"issue":"5","key":"9939_CR44","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V., Lounici, K., Tsybakov, A.B.: Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Stat. 39(5), 2302\u20132329 (2011)","journal-title":"Ann. Stat."},{"key":"9939_CR45","unstructured":"Larsen, R.: Propack-software for large and sparse SVD calculations (2004). http:\/\/sun.stanford.edu\/~rmunk\/PROPACK"},{"issue":"2","key":"9939_CR46","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1214\/17-AOS1562","volume":"46","author":"G Lecu\u00e9","year":"2018","unstructured":"Lecu\u00e9, G., Mendelson, S.: Regularization and the small-ball method I: sparse recovery. Ann. Stat. 46(2), 611\u2013641 (2018)","journal-title":"Ann. Stat."},{"key":"9939_CR47","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J.f Convex Anal. 2, 173\u2013183 (1995)","journal-title":"J.f Convex Anal."},{"key":"9939_CR48","first-page":"559","volume":"16","author":"PL Loh","year":"2015","unstructured":"Loh, P.L., Wainwright, M.J.: Regularized m-estimators with nonconvexity: statistical and algorithmic theory for local optima. J. Mach. Learn. Res. 16, 559\u2013616 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR49","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1214\/09-AOS683","volume":"37","author":"J Lv","year":"2009","unstructured":"Lv, J., Fan, Y.: A unified approach to model selection and sparse recovery using regularized least squares. Ann. Stat. 37, 3498\u20133528 (2009)","journal-title":"Ann. Stat."},{"key":"9939_CR50","unstructured":"Ma, C., Wang, K., Chi, Y., Chen, Y.: Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion and blind deconvolution (2017). arXiv preprint arXiv:1711.10467"},{"key":"9939_CR51","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11, 2287\u20132322 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR52","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1198\/jasa.2011.tm09738","volume":"106","author":"R Mazumder","year":"2011","unstructured":"Mazumder, R., Friedman, J.H., Hastie, T.: Sparsenet: coordinate descent with nonconvex penalties. J. Am. Stat. Assoc. 106, 1125\u20131138 (2011)","journal-title":"J. Am. Stat. Assoc."},{"key":"9939_CR53","unstructured":"Mazumder, R., Radchenko, P.: The discrete dantzig selector: estimating sparse linear models via mixed integer linear optimization (2015). arXiv preprint arXiv:1508.01922"},{"key":"9939_CR54","unstructured":"Mazumder, R., Radchenko, P., Dedieu, A.: Subset selection with shrinkage: sparse linear modeling when the SNR is low (2017). arXiv preprint arXiv:1708.03288"},{"key":"9939_CR55","doi-asserted-by":"crossref","unstructured":"Mohan, K., Fazel, M.: Reweighted nuclear norm minimization with application to system identification. In: Proceedings of the 2010 American Control Conference, pp. 2953\u20132959. IEEE (2010)","DOI":"10.1109\/ACC.2010.5531594"},{"issue":"Nov","key":"9939_CR56","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13(Nov), 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR57","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1214\/10-AOS850","volume":"39","author":"SN Negahban","year":"2011","unstructured":"Negahban, S.N., Wainwright, M.J.: Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann. Stat. 39, 1069\u20131097 (2011)","journal-title":"Ann. Stat."},{"key":"9939_CR58","first-page":"1665","volume":"13","author":"SN Negahban","year":"2012","unstructured":"Negahban, S.N., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR59","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/S0036139997327794","volume":"61","author":"M Nikolova","year":"2000","unstructured":"Nikolova, M.: Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math. 61, 633\u2013658 (2000)","journal-title":"SIAM J. Appl. Math."},{"key":"9939_CR60","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. 12, 3413\u20133430 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9939_CR61","doi-asserted-by":"crossref","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 Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"9939_CR62","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"9939_CR63","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde, A., Tsybakov, A.B.: Estimation of high-dimensional low-rank matrices. Ann. Stat. 39, 887\u2013930 (2011)","journal-title":"Ann. Stat."},{"issue":"4","key":"9939_CR64","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/TSP.2018.2885494","volume":"67","author":"A Shapiro","year":"2018","unstructured":"Shapiro, A., Xie, Y., Zhang, R.: Matrix completion with deterministic pattern: a geometric perspective. IEEE Trans. Signal Process. 67(4), 1088\u20131103 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"9939_CR65","unstructured":"SIGKDD, A., Netflix: Soft modelling by latent variables: the nonlinear iterative partial least squares (NIPALS) approach. In: Proceedings of KDD Cup and Workshop (2007)"},{"issue":"6","key":"9939_CR66","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1214\/aos\/1176345632","volume":"9","author":"CM Stein","year":"1981","unstructured":"Stein, C.M.: Estimation of the mean of a multivariate normal distribution. Ann. Stat. 9(6), 1135\u20131151 (1981)","journal-title":"Ann. Stat."},{"key":"9939_CR67","volume-title":"Matrix Perturbation Theory. Computer Science and Scientific Computing","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.G.: Matrix Perturbation Theory. Computer Science and Scientific Computing. Academic Press, Cambridge (1990)"},{"issue":"11","key":"9939_CR68","doi-asserted-by":"crossref","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","volume":"62","author":"R Sun","year":"2016","unstructured":"Sun, R., Luo, Z.Q.: Guaranteed matrix completion via non-convex factorization. IEEE Trans. Inf. Theory 62(11), 6535\u20136579 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9939_CR69","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"issue":"6","key":"9939_CR70","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1093\/bioinformatics\/17.6.520","volume":"17","author":"O Troyanskaya","year":"2001","unstructured":"Troyanskaya, O., Cantor, M., Sherlock, G., Brown, P., Hastie, T., Tibshirani, R., Botstein, D., Altman, R.B.: Missing value estimation methods for dna microarrays. Bioinformatics 17(6), 520\u2013525 (2001)","journal-title":"Bioinformatics"},{"key":"9939_CR71","doi-asserted-by":"crossref","unstructured":"Wang, S., Weng, H., Maleki, A.: Which bridge estimator is the best for variable selection? Ann. Stat. (2019) (accepted)","DOI":"10.1214\/19-AOS1906"},{"key":"9939_CR72","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"4","key":"9939_CR73","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1214\/12-STS399","volume":"27","author":"CH Zhang","year":"2012","unstructured":"Zhang, C.H., Zhang, T.: A general theory of concave regularization for high-dimensional sparse estimation problems. Stat. Sci. 27(4), 576\u2013593 (2012)","journal-title":"Stat. Sci."},{"key":"9939_CR74","unstructured":"Zheng, Q., Lafferty, J.: Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent (2016). arXiv preprint arXiv:1605.07051"},{"issue":"11","key":"9939_CR75","doi-asserted-by":"crossref","first-page":"6896","DOI":"10.1109\/TIT.2017.2717585","volume":"63","author":"L Zheng","year":"2017","unstructured":"Zheng, L., Maleki, A., Weng, H., Wang, X., Long, T.: Does $$\\ell _p$$-minimization outperform $$\\ell _1$$-minimization? IEEE Trans. Inf. Theory 63(11), 6896\u20136935 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"476","key":"9939_CR76","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou, H.: The adaptive lasso and its oracle properties. J. Am. Stat. Assoc. 101(476), 1418\u20131429 (2006)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"9939_CR77","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1214\/009053607000000802","volume":"36","author":"H Zou","year":"2008","unstructured":"Zou, H., Li, R.: One-step sparse estimates in nonconcave penalized likelihood models. Ann. Stat. 36(4), 1509\u20131533 (2008)","journal-title":"Ann. Stat."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09939-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-020-09939-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09939-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T05:30:31Z","timestamp":1722576631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-020-09939-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,14]]},"references-count":77,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9939"],"URL":"https:\/\/doi.org\/10.1007\/s11222-020-09939-5","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2020,3,14]]},"assertion":[{"value":"25 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}