{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:04Z","timestamp":1740122764256,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:00:00Z","timestamp":1619222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1736326"],"award-info":[{"award-number":["DMS-1736326"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10589-021-00276-5","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T08:18:25Z","timestamp":1619338705000},"page":"273-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low-rank factorization for rank minimization with nonconvex regularizers"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6467-3958","authenticated-orcid":false,"given":"April","family":"Sagan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,24]]},"reference":[{"key":"276_CR1","unstructured":"Movielens. https:\/\/grouplens.org\/datasets\/movielens\/. Accessed: 2019-11-21"},{"issue":"4","key":"276_CR2","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1137\/0614061","volume":"14","author":"A Andrew","year":"1993","unstructured":"Andrew, A., Chu, K., Lancaster, P.: Derivatives of eigenvalues and eigenvectors of matrix functions. SIAM J. Matrix Anal. Appl. 14(4), 903\u2013926 (1993). https:\/\/doi.org\/10.1137\/0614061","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"276_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0352-8","journal-title":"Math. Program."},{"key":"276_CR4","doi-asserted-by":"publisher","unstructured":"C.\u00a0Lu J.\u00a0Tang, S.Y., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. Proceedings of the IEEE computer society conference on computer vision and pattern recognition (2014). https:\/\/doi.org\/10.1109\/CVPR.2014.526","DOI":"10.1109\/CVPR.2014.526"},{"issue":"5","key":"276_CR5","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theor. 56(5), 2053\u20132080 (2010). https:\/\/doi.org\/10.1109\/TIT.2010.2044061","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"456","key":"276_CR6","doi-asserted-by":"publisher","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(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"276_CR7","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices. Proceedings of the 2003 American Control Conference, 2003. 3, 2156\u20132162 vol.3 (2003)","DOI":"10.1109\/ACC.2003.1243393"},{"issue":"7","key":"276_CR8","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1109\/83.392335","volume":"4","author":"D Geman","year":"1995","unstructured":"Geman, D.: Chengda Yang: nonlinear image recovery with half-quadratic regularization. IEEE Trans. Image Process. 4(7), 932\u2013946 (1995)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"276_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K Goldberg","year":"2001","unstructured":"Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: a constant time collaborative filtering algorithm. Inf. Retr. 4(2), 133\u2013151 (2001). https:\/\/doi.org\/10.1023\/A:1011419012209","journal-title":"Inf. Retr."},{"issue":"1","key":"276_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1215\/S0012-7094-53-02004-3","volume":"20","author":"AJ Hoffman","year":"1953","unstructured":"Hoffman, A.J., Wielandt, H.W.: The variation of the spectrum of a normal matrix. Duke Math. J. 20(1), 37\u201339 (1953). https:\/\/doi.org\/10.1215\/S0012-7094-53-02004-3","journal-title":"Duke Math. J."},{"issue":"4","key":"276_CR11","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Candes, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"276_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_q$$ minimization. SIAM J. Num. Anal. 51(2), 927\u2013957 (2013). https:\/\/doi.org\/10.1137\/110840364","journal-title":"SIAM J. Num. Anal."},{"issue":"4","key":"276_CR13","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li, Q., Qi, Hd.: A sequential semismooth newton method for the nearest low-rank correlation matrix problem. SIAM J. Optim. 21(4), 1641\u20131666 (2011)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"276_CR14","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2010","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31(3), 1235\u20131256 (2010). https:\/\/doi.org\/10.1137\/090755436","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"276_CR15","unstructured":"Lu, C., Zhu, C., Xu, C., Yan, S., Lin, Z.: Generalized singular value thresholding. arXiv abs\/1412.2231 (2014). arXiv: 1412.2231"},{"issue":"2","key":"276_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/s0266466600011129","volume":"1","author":"J Magnus","year":"1985","unstructured":"Magnus, J.: On differentiating eigenvalues and eigenvectors. Econo. Theory 1(2), 179\u2013191 (1985). https:\/\/doi.org\/10.1017\/s0266466600011129","journal-title":"Econo. Theory"},{"key":"276_CR17","doi-asserted-by":"publisher","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted least squares for matrix rank minimization. 2010 48th Annual Allerton Conference on communication, control and computing (Allerton) (2010).https:\/\/doi.org\/10.1109\/allerton.2010.5706969","DOI":"10.1109\/allerton.2010.5706969"},{"key":"276_CR18","doi-asserted-by":"publisher","unstructured":"Rennie, J.D.M., Srebro, N.: Fast maximum margin matrix factorization for collaborative prediction. In: Proceedings of the 22nd International Conference on machine learning, ICML\u201905, p. 713\u2013719. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1102351.1102441","DOI":"10.1145\/1102351.1102441"},{"key":"276_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2009","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128, 321\u2013353 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"276_CR20","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/s10957-020-01731-","volume":"186","author":"A Sagan","year":"2020","unstructured":"Sagan, A., Shen, X., Mitchell, J.E.: Two relaxation methods for rank minimization problems. J. Optim. Theory Appl. 186(3), 806\u2013825 (2020). https:\/\/doi.org\/10.1007\/s10957-020-01731-","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"276_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-018-0010-6","volume":"71","author":"X Shen","year":"2018","unstructured":"Shen, X., Mitchell, J.: A penalty method for rank minimization problems in symmetric matrices. Comput. Optim. Appl. 71(2), 353\u2013380 (2018). https:\/\/doi.org\/10.1007\/s10589-018-0010-6","journal-title":"Comput. Optim. Appl."},{"key":"276_CR22","unstructured":"Srebro, N., Rennie, J.D.M., Jaakkola, T.S.: Maximum-margin matrix factorization. In: Proceedings of the 17th International Conference on neural information processing systems, NIPS\u201904, p. 1329\u20131336. MIT Press, Cambridge, MA, USA (2004)"},{"issue":"104","key":"276_CR23","first-page":"3367","volume":"16","author":"T Hastie","year":"2015","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(104), 3367\u20133402 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"276_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003","author":"J Tanner","year":"2015","unstructured":"Tanner, J., Wei, K.: Low rank matrix completion by alternating steepest descent methods. Appl. Comput. Harmonic Anal. (2015). https:\/\/doi.org\/10.1016\/j.acha.2015.08.003","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"5","key":"276_CR25","doi-asserted-by":"publisher","first-page":"3124","DOI":"10.1109\/tit.2018.2881749","volume":"65","author":"A Tasissa","year":"2019","unstructured":"Tasissa, A., Lai, R.: Exact reconstruction of euclidean distance geometry problem using low-rank matrix completion. IEEE Trans. Inform. Theory 65(5), 3124\u20133144 (2019). https:\/\/doi.org\/10.1109\/tit.2018.2881749","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"276_CR26","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TMI.2008.927346","volume":"28","author":"J Trzasko","year":"2009","unstructured":"Trzasko, J., Manduca, A.: Highly undersampled magnetic resonance image reconstruction via homotopic $$\\ell _{0}$$ -minimization. IEEE Trans. Med. Imag. 28(1), 106\u2013121 (2009)","journal-title":"IEEE Trans. Med. Imag."},{"issue":"4","key":"276_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0044-1","journal-title":"Math. Program. Comput."},{"issue":"3","key":"276_CR28","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imag. Sci. 6(3), 1758\u20131789 (2013). https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J. Imag. Sci."},{"issue":"3","key":"276_CR29","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1007\/s10915-016-0169-x","volume":"68","author":"Y Lou","year":"2016","unstructured":"Lou, Y., Yin, P., Xin, J.: Point source super-resolution via non-convex $$l_1$$ based methods. J. Sci. Comput. 68(3), 1082\u20131100 (2016)","journal-title":"J. Sci. Comput."},{"key":"276_CR30","doi-asserted-by":"publisher","unstructured":"Yao, Q., Kwok, J., Zhong, W.: Fast low-rank matrix learning with nonconvex regularization. 2015 IEEE International conference on data mining (2015). https:\/\/doi.org\/10.1109\/icdm.2015.9","DOI":"10.1109\/icdm.2015.9"},{"key":"276_CR31","doi-asserted-by":"publisher","unstructured":"Yao, Q., Kwok, J.T., Gao, F., Chen, W., Liu, T.Y.: Efficient inexact proximal gradient algorithm for nonconvex problems. Proceedings of the Twenty-Sixth International Joint Conference on artificial intelligence (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/462","DOI":"10.24963\/ijcai.2017\/462"},{"issue":"11","key":"276_CR32","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/TPAMI.2018.2858249","volume":"41","author":"Q Yao","year":"2019","unstructured":"Yao, Q., Kwok, J.T., Wang, T., Liu, T.: Large-scale low-rank matrix learning with nonconvex regularizers. IEEE Trans. Pattern Anal. Mach. Intell. 41(11), 2628\u20132643 (2019). https:\/\/doi.org\/10.1109\/TPAMI.2018.2858249","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"276_CR33","doi-asserted-by":"publisher","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. Annal. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Annal. Stat."},{"key":"276_CR34","doi-asserted-by":"publisher","unstructured":"Zhang, D., Hu, Y., Ye, J., Li, X., He, X.: Matrix completion by truncated nuclear norm regularization. 2012 IEEE Conference on computer vision and pattern recognition pp. 2192\u20132199 (2012). https:\/\/doi.org\/10.1109\/CVPR.2012.6247927","DOI":"10.1109\/CVPR.2012.6247927"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00276-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00276-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00276-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T10:00:03Z","timestamp":1724925603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00276-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,24]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00276-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,4,24]]},"assertion":[{"value":"14 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}