{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:47:17Z","timestamp":1776746837370,"version":"3.51.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t Augsburg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We consider gradient-related methods for low-rank matrix optimization with a smooth cost function. The methods operate on single factors of the low-rank factorization and share aspects of both alternating and Riemannian optimization. Two possible choices for the search directions based on Gauss\u2013Southwell type selection rules are compared: one using the gradient of a factorized non-convex formulation, the other using the Riemannian gradient. While both methods provide gradient convergence guarantees that are similar to the unconstrained case, numerical experiments on a quadratic cost function indicate that the version based on the Riemannian gradient is significantly more robust with respect to small singular values and the condition number of the cost function. As a side result of our approach, we also obtain new convergence results for the alternating least squares method.<\/jats:p>","DOI":"10.1007\/s10957-025-02682-9","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T08:59:16Z","timestamp":1746435556000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Gauss\u2013Southwell Type Descent Methods for Low-Rank Matrix Optimization"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2767-0480","authenticated-orcid":false,"given":"Guillaume","family":"Olikier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Uschmajew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6501-816X","authenticated-orcid":false,"given":"Bart","family":"Vandereycken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"issue":"2","key":"2682_CR1","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/08072019X","volume":"47","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Gallivan, K.A.: Accelerated line-search and trust-region methods. SIAM J. Numer. Anal. 47(2), 997\u20131018 (2009). https:\/\/doi.org\/10.1137\/08072019X","journal-title":"SIAM J. Numer. Anal."},{"key":"2682_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008). https:\/\/doi.org\/10.1515\/9781400830244"},{"issue":"1","key":"2682_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A.: On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM J. Optim. 25(1), 185\u2013209 (2015). https:\/\/doi.org\/10.1137\/13094829X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2682_CR4","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1137\/16M1095202","volume":"39","author":"F Feppon","year":"2018","unstructured":"Feppon, F., Lermusiaux, P.F.J.: A geometric approach to dynamical model order reduction. SIAM J. Matrix Anal. Appl. 39(1), 510\u2013538 (2018). https:\/\/doi.org\/10.1137\/16M1095202","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2682_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2189-8","volume-title":"Algebraic Geometry: A First Course","author":"J Harris","year":"1992","unstructured":"Harris, J.: Algebraic Geometry: A First Course. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4757-2189-8"},{"issue":"1\u20132","key":"2682_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.Q.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163(1\u20132), 85\u2013114 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1057-8","journal-title":"Math. Program."},{"key":"2682_CR7","doi-asserted-by":"publisher","unstructured":"Hosseini, S., Luke, D.R., Uschmajew, A.: Tangent and normal cones for low-rank matrices. In: Nonsmooth Optimization and Its Applications, pp. 45\u201353. Birkh\u00e4user\/Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11370-4_3","DOI":"10.1007\/978-3-030-11370-4_3"},{"issue":"1\u20132","key":"2682_CR8","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10107-022-01851-2","volume":"199","author":"E Levin","year":"2023","unstructured":"Levin, E., Kileel, J., Boumal, N.: Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy. Math. Program. 199(1\u20132), 831\u2013864 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01851-2","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2682_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10107-024-02058-3","volume":"209","author":"E Levin","year":"2025","unstructured":"Levin, E., Kileel, J., Boumal, N.: The effect of smooth parametrizations on nonconvex optimization landscapes. Math. Program. 209(1\u20132), 63\u2013111 (2025). https:\/\/doi.org\/10.1007\/s10107-024-02058-3","journal-title":"Math. Program."},{"issue":"1","key":"2682_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/imaiai\/iay003","volume":"8","author":"Q Li","year":"2019","unstructured":"Li, Q., Zhu, Z., Tang, G.: The non-convex geometry of low-rank matrix optimization. Inf. Inference 8(1), 51\u201396 (2019). https:\/\/doi.org\/10.1093\/imaiai\/iay003","journal-title":"Inf. Inference"},{"issue":"1","key":"2682_CR11","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/18M1224738","volume":"30","author":"X Li","year":"2020","unstructured":"Li, X., Zhu, Z., So, A.M.C., Vidal, R.: Nonconvex robust low-rank matrix recovery. SIAM J. Optim. 30(1), 660\u2013686 (2020). https:\/\/doi.org\/10.1137\/18M1224738","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2682_CR12","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1287\/moor.2023.1377","volume":"49","author":"Y Luo","year":"2024","unstructured":"Luo, Y., Li, X., Zhang, A.R.: On geometric connections of embedded and quotient geometries in Riemannian fixed-rank matrix optimization. Math. Oper. Res. 49(2), 782\u2013825 (2024). https:\/\/doi.org\/10.1287\/moor.2023.1377","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2682_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72(1), 7\u201335 (1992). https:\/\/doi.org\/10.1007\/BF00939948","journal-title":"J. Optim. Theory Appl."},{"key":"2682_CR14","unstructured":"Mishra, B., Adithya\u00a0Apuroop, K., Sepulchre, R.: A Riemannian geometry for low-rank matrix completion. arXiv:1211.1550 (2012)"},{"issue":"2","key":"2682_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012). https:\/\/doi.org\/10.1137\/100802001","journal-title":"SIAM J. Optim."},{"key":"2682_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91578-4"},{"key":"2682_CR17","unstructured":"Nutini, J., Laradji, I., Schmidt, M.: Let\u2019s make block coordinate descent converge faster: Faster greedy rules, message-passing, active-set complexity, and superlinear convergence. J. Mach. Learn. Res. 23(131), 1\u201374 (2022). https:\/\/jmlr.org\/papers\/v23\/18-045.html"},{"key":"2682_CR18","unstructured":"Nutini, J., Schmidt, M., Laradji, I., Friedlander, M., Koepke, H.: Coordinate descent converges faster with the Gauss\u2013Southwell rule than random selection. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 1632\u20131641. PMLR (2015). https:\/\/proceedings.mlr.press\/v37\/nutini15.html"},{"issue":"2","key":"2682_CR19","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s11228-021-00618-9","volume":"30","author":"G Olikier","year":"2022","unstructured":"Olikier, G., Absil, P.A.: On the continuity of the tangent cone to the determinantal variety. Set-Valued Var. Anal. 30(2), 769\u2013788 (2022). https:\/\/doi.org\/10.1007\/s11228-021-00618-9","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"2682_CR20","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1137\/22M1518256","volume":"44","author":"G Olikier","year":"2023","unstructured":"Olikier, G., Absil, P.A.: An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration. SIAM J. Matrix Anal. Appl. 44(3), 1421\u20131435 (2023). https:\/\/doi.org\/10.1137\/22M1518256","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2682_CR21","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative methods for linear systems of equations: a brief historical journey. In: 75 Years of Mathematics of Computation, pp. 197\u2013215. Amer. Math. Soc., [Providence], RI (2020). https:\/\/doi.org\/10.1090\/conm\/754\/15141","DOI":"10.1090\/conm\/754\/15141"},{"issue":"1","key":"2682_CR22","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/140957822","volume":"25","author":"R Schneider","year":"2015","unstructured":"Schneider, R., Uschmajew, A.: Convergence results for projected line-search methods on varieties of low-rank matrices via \u0141ojasiewicz inequality. SIAM J. Optim. 25(1), 622\u2013646 (2015). https:\/\/doi.org\/10.1137\/140957822","journal-title":"SIAM J. Optim."},{"issue":"11","key":"2682_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/TIT.2016.2598574","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2682_CR24","doi-asserted-by":"publisher","first-page":"A1803","DOI":"10.1137\/20M1337430","volume":"43","author":"M Sutti","year":"2021","unstructured":"Sutti, M., Vandereycken, B.: Riemannian multigrid line search for low-rank problems. SIAM J. Sci. Comput. 43(3), A1803\u2013A1831 (2021). https:\/\/doi.org\/10.1137\/20M1337430","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2682_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.acha.2015.08.003","volume":"40","author":"J Tanner","year":"2016","unstructured":"Tanner, J., Wei, K.: Low rank matrix completion by alternating steepest descent methods. Appl. Comput. Harmon. Anal. 40(2), 417\u2013429 (2016). https:\/\/doi.org\/10.1016\/j.acha.2015.08.003","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2682_CR26","unstructured":"Tong, T., Ma, C., Chi, Y.: Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent. J. Mach. Learn. Res. 22(150), 1\u201363 (2021) https:\/\/jmlr.org\/papers\/v22\/20-1067.html"},{"issue":"2","key":"2682_CR27","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). https:\/\/doi.org\/10.1137\/110845768","journal-title":"SIAM J. Optim."},{"issue":"13","key":"2682_CR28","doi-asserted-by":"publisher","first-page":"3614","DOI":"10.1109\/TSP.2018.2835403","volume":"66","author":"Z Zhu","year":"2018","unstructured":"Zhu, Z., Li, Q., Tang, G., Wakin, M.B.: Global optimality in low-rank matrix optimization. IEEE Trans. Signal Process. 66(13), 3614\u20133628 (2018). https:\/\/doi.org\/10.1109\/TSP.2018.2835403","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2682_CR29","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/tit.2021.3049171","volume":"67","author":"Z Zhu","year":"2021","unstructured":"Zhu, Z., Li, Q., Tang, G., Wakin, M.B.: The global optimization geometry of low-rank matrix optimization. IEEE Trans. Inform. Theory 67(2), 1308\u20131331 (2021). https:\/\/doi.org\/10.1109\/tit.2021.3049171","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02682-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02682-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02682-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T04:41:27Z","timestamp":1763181687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02682-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2682"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02682-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,5]]},"assertion":[{"value":"17 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}