{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T12:16:05Z","timestamp":1742645765733,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771001"],"award-info":[{"award-number":["61771001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10915-023-02266-7","type":"journal-article","created":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T08:02:08Z","timestamp":1686988928000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Gradient Method for Low-Rank Matrix Estimation"],"prefix":"10.1007","volume":"96","author":[{"given":"Hongyi","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Peng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0497-7903","authenticated-orcid":false,"given":"Chengwei","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Di","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"issue":"1","key":"2266_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"PA Absil","year":"2012","unstructured":"Absil, P.A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2266_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10589-014-9714-4","volume":"62","author":"PA Absil","year":"2015","unstructured":"Absil, P.A., Oseledets, I.V.: Low-rank retractions: a survey and new results. Comput. Optim. Appl. 62(1), 5\u201329 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"2266_CR3","unstructured":"Ahn, K., Sra, S.: From Nesterov\u2019s estimate sequence to Riemannian acceleration. In: Conference on Learning Theory, pp. 84\u2013118. PMLR (2020)"},{"key":"2266_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds. Cambridge University Press (2023)"},{"key":"2266_CR5","doi-asserted-by":"crossref","unstructured":"Cai, J.F., Wei, K.: Exploiting the structure effectively and efficiently in low-rank matrix recovery. In: Handbook of Numerical Analysis, vol.\u00a019, pp. 21\u201351. Elsevier (2018)","DOI":"10.1016\/bs.hna.2018.09.001"},{"issue":"4","key":"2266_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MSP.2018.2821706","volume":"35","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Chi, Y.: Harnessing structures in big data via guaranteed low-rank matrix estimation: recent theory and fast algorithms via convex and nonconvex optimization. IEEE Sign. Process Mag. 35(4), 14\u201331 (2018)","journal-title":"IEEE Sign. Process Mag."},{"key":"2266_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-019-01363-6","volume":"176","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C.: Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval. Math. Program. 176, 5\u201337 (2019)","journal-title":"Math. Program."},{"issue":"5","key":"2266_CR8","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1561\/2200000079","volume":"14","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C., et al.: Spectral methods for data science: a statistical perspective. Found. Trends Mach. Learn. 14(5), 566\u2013806 (2021)","journal-title":"Found. Trends Mach. Learn."},{"issue":"20","key":"2266_CR9","doi-asserted-by":"publisher","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. Sign. Process. 67(20), 5239\u20135269 (2019)","journal-title":"IEEE Trans. Sign. Process."},{"key":"2266_CR10","doi-asserted-by":"crossref","unstructured":"Chunikhina, E., Raich, R., Nguyen, T.: Performance analysis for matrix completion via iterative hard-thresholded SVD. In: 2014 IEEE Workshop on Statistical Signal Processing (SSP), pp. 392\u2013395. IEEE (2014)","DOI":"10.1109\/SSP.2014.6884658"},{"issue":"4","key":"2266_CR11","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","volume":"10","author":"MA Davenport","year":"2016","unstructured":"Davenport, M.A., Romberg, J.: An overview of low-rank matrix recovery from incomplete observations. IEEE J. Sel. Top. Sign. Process. 10(4), 608\u2013622 (2016)","journal-title":"IEEE J. Sel. Top. Sign. Process."},{"issue":"2","key":"2266_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/21M1395648","volume":"4","author":"V Duruisseaux","year":"2022","unstructured":"Duruisseaux, V., Leok, M.: A variational formulation of accelerated optimization on Riemannian manifolds. SIAM J. Math. Data Sci. 4(2), 649\u2013674 (2022)","journal-title":"SIAM J. Math. Data Sci."},{"key":"2266_CR13","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10589-015-9775-z","volume":"63","author":"CC Gonzaga","year":"2016","unstructured":"Gonzaga, C.C., Schneider, R.M.: On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63, 523\u2013542 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"2266_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.laa.2004.10.009","volume":"397","author":"J Huang","year":"2005","unstructured":"Huang, J., Zhou, J.: A direct proof and a generalization for a Kantorovich type inequality. Linear Algebra Appl. 397, 185\u2013192 (2005)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2266_CR15","doi-asserted-by":"publisher","first-page":"e2409","DOI":"10.1002\/nla.2409","volume":"29","author":"W Huang","year":"2022","unstructured":"Huang, W., Wei, K.: An extension of fast iterative shrinkage-thresholding algorithm to Riemannian optimization for sparse principal component analysis. Numer. Linear Algebra Appl. 29(1), e2409 (2022)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2266_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-01962-0","volume":"90","author":"Y Huang","year":"2022","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W., Zhang, H.: On the asymptotic convergence and acceleration of gradient methods. J. Sci. Comput. 90, 1\u201329 (2022)","journal-title":"J. Sci. Comput."},{"key":"2266_CR17","unstructured":"Jain, P., Meka, R., Dhillon, I.: Guaranteed rank minimization via singular value projection. Adv. Neu. Inf. Process. Syst. 23 (2010)"},{"issue":"1","key":"2266_CR18","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s10957-018-1287-4","volume":"178","author":"D Kim","year":"2018","unstructured":"Kim, D., Fessler, J.A.: Adaptive restart of the optimized gradient method for convex optimization. J. Optim. Theory Appl. 178(1), 240\u2013263 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"2266_CR19","unstructured":"Kim, J., Yang, I.: Nesterov acceleration for Riemannian optimization. arXiv preprint arXiv:2202.02036 (2022)"},{"key":"2266_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10851-013-0434-7","volume":"48","author":"A Kyrillidis","year":"2014","unstructured":"Kyrillidis, A., Cevher, V.: Matrix recipes for hard thresholding methods. J. Math. Imag. Vis. 48, 235\u2013265 (2014)","journal-title":"J. Math. Imag. Vis."},{"issue":"1","key":"2266_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Optim."},{"issue":"11","key":"2266_CR22","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1109\/JPROC.2020.3007634","volume":"108","author":"H Li","year":"2020","unstructured":"Li, H., Fang, C., Lin, Z.: Accelerated first-order optimization algorithms for machine learning. Proc. IEEE 108(11), 2067\u20132082 (2020)","journal-title":"Proc. IEEE"},{"key":"2266_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","volume":"79","author":"H Li","year":"2019","unstructured":"Li, H., Lin, Z.: Accelerated alternating direction method of multipliers: an optimal o (1\/k) nonergodic analysis. J. Sci. Comput. 79, 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2266_CR24","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/16M106340X","volume":"27","author":"J Liang","year":"2017","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Activity identification and local linear convergence of forward-backward-type methods. SIAM J. Optim. 27(1), 408\u2013437 (2017)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2266_CR25","doi-asserted-by":"publisher","first-page":"A1069","DOI":"10.1137\/21M1395685","volume":"44","author":"J Liang","year":"2022","unstructured":"Liang, J., Luo, T., Schonlieb, C.B.: Improving \u201cfast iterative shrinkage-thresholding algorithm\u2019\u2019: faster, smarter, and greedier. SIAM J. Sci. Comput. 44(3), A1069\u2013A1091 (2022)","journal-title":"SIAM J. Sci. Comput."},{"key":"2266_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85450-8","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2021","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming, vol. 228. Springer Nature (2021)"},{"key":"2266_CR27","unstructured":"Nesterov, Y.E.: A method of solving a convex programming problem with convergence rate o$$\\left(\\frac{1}{k^{2}}\\right)$$. In: Doklady Akademii Nauk, vol. 269, pp. 543\u2013547. Russian Academy of Sciences (1983)"},{"key":"2266_CR28","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B Odonoghue","year":"2015","unstructured":"Odonoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"2266_CR29","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10915-021-01648-z","volume":"89","author":"J Park","year":"2021","unstructured":"Park, J.: Accelerated additive Schwarz methods for convex optimization with adaptive restart. J. Sci. Comput. 89(3), 58 (2021)","journal-title":"J. Sci. Comput."},{"issue":"5","key":"2266_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"5","key":"2266_CR31","doi-asserted-by":"publisher","first-page":"S104","DOI":"10.1137\/120876459","volume":"35","author":"J Tanner","year":"2013","unstructured":"Tanner, J., Wei, K.: Normalized iterative hard thresholding for matrix completion. SIAM J. Sci. Comput. 35(5), S104\u2013S125 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2266_CR32","first-page":"6639","volume":"22","author":"T Tong","year":"2021","unstructured":"Tong, T., Ma, C., Chi, Y.: Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent. J. Mach. Learn. Res. 22(1), 6639\u20136701 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"2266_CR33","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization. SIAM J. Optim. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"key":"2266_CR34","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: Accelerating iterative hard thresholding for low-rank matrix completion via adaptive restart. In: 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2917\u20132921. IEEE (2019)","DOI":"10.1109\/ICASSP.2019.8683082"},{"key":"2266_CR35","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: On local convergence of iterative hard thresholding for matrix completion. arXiv preprint arXiv:2112.14733 (2021)","DOI":"10.1109\/TSP.2022.3229644"},{"key":"2266_CR36","doi-asserted-by":"publisher","first-page":"4061","DOI":"10.1109\/TSP.2022.3192142","volume":"70","author":"T Vu","year":"2022","unstructured":"Vu, T., Raich, R.: On asymptotic linear convergence of projected gradient descent for constrained least squares. IEEE Trans. Sign. Process. 70, 4061\u20134076 (2022)","journal-title":"IEEE Trans. Sign. Process."},{"issue":"2","key":"2266_CR37","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10915-021-01548-2","volume":"88","author":"D Wang","year":"2021","unstructured":"Wang, D., He, Y., De Sterck, H.: On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM. J. Sci. Comput. 88(2), 38 (2021)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2266_CR38","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10915-021-01550-8","volume":"88","author":"H Wang","year":"2021","unstructured":"Wang, H., Cai, J.F., Wang, T., Wei, K.: Fast Cadzow\u2019s algorithm and a gradient variant. J. Sci. Comput. 88(2), 41 (2021)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2266_CR39","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10915-022-02016-1","volume":"93","author":"R Wang","year":"2022","unstructured":"Wang, R., Zhang, C., Wang, L., Shao, Y.: A stochastic Nesterov\u2019s smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization. J. Sci. Comput. 93(2), 52 (2022)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2266_CR40","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1137\/15M1050525","volume":"37","author":"K Wei","year":"2016","unstructured":"Wei, K., Cai, J.F., Chan, T.F., Leung, S.: Guarantees of Riemannian optimization for low rank matrix recovery. SIAM J. Matrix Anal. Appl. 37(3), 1198\u20131222 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2266_CR41","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3934\/ipi.2020011","volume":"14","author":"K Wei","year":"2020","unstructured":"Wei, K., Cai, J.F., Chan, T.F., Leung, S.: Guarantees of Riemannian optimization for low rank matrix completion. Inverse Probl. Imag. 14(2), 233\u2013265 (2020)","journal-title":"Inverse Probl. Imag."},{"issue":"47","key":"2266_CR42","doi-asserted-by":"publisher","first-page":"E7351","DOI":"10.1073\/pnas.1614734113","volume":"113","author":"A Wibisono","year":"2016","unstructured":"Wibisono, A., Wilson, A.C., Jordan, M.I.: A variational perspective on accelerated methods in optimization. Proc. Natl. Acad. Sci. 113(47), E7351\u2013E7358 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2266_CR43","unstructured":"Zhang, H., Sra, S.: Towards Riemannian accelerated gradient methods. arXiv preprint arXiv:1806.02812 (2018)"},{"issue":"1","key":"2266_CR44","first-page":"3101","volume":"19","author":"T Zhang","year":"2018","unstructured":"Zhang, T., Yang, Y.: Robust PCA by manifold optimization. J. Mach. Learn. Res. 19(1), 3101\u20133139 (2018)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02266-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02266-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02266-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T08:11:47Z","timestamp":1689581507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02266-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2266"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02266-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"25 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}