{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:28:36Z","timestamp":1787326116029,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"name":"Guandong Basic and Applied Research Foundation","award":["2021A1515110530"],"award-info":[{"award-number":["2021A1515110530"]}]},{"name":"Educational Commission of Guangdong Province of China","award":["2019KZDZX1007"],"award-info":[{"award-number":["2019KZDZX1007"]}]},{"name":"Guangdong Key Laboratory of Intelligent Information Processing"},{"name":"National Natural Science Foundation-Research Grants Council Joint Fund","award":["N-HKU76921"],"award-info":[{"award-number":["N-HKU76921"]}]},{"DOI":"10.13039\/501100012243","name":"Foundation for Distinguished Young Talents in Higher Education of Guangdong","doi-asserted-by":"publisher","award":["2021KQNCX075"],"award-info":[{"award-number":["2021KQNCX075"]}],"id":[{"id":"10.13039\/501100012243","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020B1515310008"],"award-info":[{"award-number":["2020B1515310008"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201456"],"award-info":[{"award-number":["12201456"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20455"],"award-info":[{"award-number":["U21A20455"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972265"],"award-info":[{"award-number":["61972265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12326619"],"award-info":[{"award-number":["12326619"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371499"],"award-info":[{"award-number":["12371499"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["12300218"],"award-info":[{"award-number":["12300218"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["12300519"],"award-info":[{"award-number":["12300519"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["17201020"],"award-info":[{"award-number":["17201020"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["17300021"],"award-info":[{"award-number":["17300021"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["C1013-21GF"],"award-info":[{"award-number":["C1013-21GF"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["C7004-21GF"],"award-info":[{"award-number":["C7004-21GF"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Imaging Sci."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>In this paper, we develop an efficient stochastic variance reduced gradient descent algorithm to solve the affine rank minimization problem consisting of finding a matrix of minimum rank from linear measurements. The proposed algorithm as a stochastic gradient descent strategy enjoys a more favorable complexity than that using full gradients. It also reduces the variance of the stochastic gradient at each iteration and accelerates the rate of convergence. We prove that the proposed algorithm converges linearly in expectation to the solution under a restricted isometry condition. Numerical experimental results demonstrate that the proposed algorithm has a clear advantageous balance of efficiency, adaptivity, and accuracy compared with other state-of-the-art algorithms.<\/jats:p>","DOI":"10.1137\/23m1555387","type":"journal-article","created":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T10:45:07Z","timestamp":1718361907000},"page":"1118-1144","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Variance Reduced Gradient for Affine Rank Minimization Problem"],"prefix":"10.1137","volume":"17","author":[{"given":"Ningning","family":"Han","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Tiangong University, Tianjin, 300387, China."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Nie","sequence":"additional","affiliation":[{"name":"Shenzhen Key Laboratory of Advanced Machine Learning and Applications, School of Mathematical Sciences, Shenzhen University, Shenzhen, 518060, China."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4599-7281","authenticated-orcid":true,"given":"Jian","family":"Lu","sequence":"additional","affiliation":[{"name":"Corresponding author. Shenzhen Key Laboratory of Advanced Machine Learning and Applications, School of Mathematical Sciences, Shenzhen University, Shenzhen, 518060, China."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6833-5227","authenticated-orcid":true,"given":"Michael K.","family":"Ng","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2024,6,4]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","unstructured":"J. D. Rennie and N. Srebro, Fast maximum margin matrix factorization for collaborative prediction, in Proceedings of the 22nd International Conference on Machine Learning, 2005, pp. 713\u2013719.","DOI":"10.1145\/1102351.1102441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1098929"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/15M1048008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/18M1202311"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2569479"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2287673"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2623606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref12","first-page":"3413","volume":"12","author":"Recht B.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref16","unstructured":"Z. C. Lin, M. M. Chen, and Y. Ma, The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices, preprint, arXiv:1009.5055, 2010."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"D. B. Zhang, Y. Hu, J. P. Ye, X. L. Li, and X. F. He, Matrix completion by truncated nuclear norm regularization, in IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 2192\u20132199.","DOI":"10.1109\/CVPR.2012.6247927"},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"C. Y. Lu, J. H. Tang, S. C. Yan, and Z. C. Lin, Generalized nonconvex nonsmooth low-rank minimization, in IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 4130\u20134137.","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref20","first-page":"3441","volume":"13","author":"Mohan K.","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100811404"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"F. P. Nie, H. Huang, and C. Ding, Low-rank matrix recovery via efficient Schatten p-norm minimization, in AAAI Conference on Artificial Intelligence, 2012, pp. 655\u2013661.","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2599290"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/9781611971941"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003"},{"key":"ref28","unstructured":"Q. Yao and J. T. Kwok, Scalable robust matrix factorization with nonconvex loss, in Advances in Neural Information Processing Systems 31, 2018, pp. 5066\u20135075."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150189"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/18M1224738"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/21M1433812"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2685518"},{"key":"ref33","first-page":"150","volume":"22","author":"Tong T.","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref35","unstructured":"S. Y. Dong, B. Gao, W. Huang, and K. A. Gallivan, On the Analysis of Optimization with Fixed-Rank Matrices: A Quotient Geometric View, preprint, arXiv:2203.06765, 2022."},{"key":"ref36","unstructured":"P. Jain, R. Meka, and I. Dhillon, Guaranteed rank minimization via singular value projection, in Advances in Neural Information Processing Systems 23, 2010, pp. 937\u2013945."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref38","first-page":"289","volume":"4","author":"Blanchard J. D.","year":"2015","journal-title":"Inf. Inference"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050525"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2749330"},{"key":"ref41","unstructured":"R. Johnson and T. Zhang, Accelerating stochastic gradient descent using predictive variance reduction, in Advances in Neural Information Processing Systems 26, 2013, pp. 315\u2013323."},{"key":"ref42","unstructured":"A. Nitanda, Stochastic proximal gradient descent with acceleration techniques, in Advances in Neural Information Processing Systems 27, 2014, pp. 1574\u20131582."},{"key":"ref43","unstructured":"H. Lin, J. Mairal, and Z. Harchaoui, A universal catalyst for first-order optimization, in Advances in Neural Information Processing Systems 28, 2015, pp. 3384\u20133392."},{"key":"ref44","unstructured":"X. Zhou, On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradient, preprint, https:\/\/arxiv.org\/abs\/1803.06573, 2018."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"}],"container-title":["SIAM Journal on Imaging Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1555387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:27:05Z","timestamp":1787322425000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1555387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,4]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1137\/23M1555387"],"URL":"https:\/\/doi.org\/10.1137\/23m1555387","relation":{},"ISSN":["1936-4954"],"issn-type":[{"value":"1936-4954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,4]]}}}