{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T04:03:25Z","timestamp":1742097805407,"version":"3.38.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2022R1A2C1011503"],"award-info":[{"award-number":["2022R1A2C1011503"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["RS-2023-00229524"],"award-info":[{"award-number":["RS-2023-00229524"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2022R1A2C1010537","2020R1F1A1A01058502"],"award-info":[{"award-number":["2022R1A2C1010537","2020R1F1A1A01058502"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s11590-024-02129-6","type":"journal-article","created":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T11:01:52Z","timestamp":1718794912000},"page":"667-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the linear convergence rate of Riemannian proximal gradient method"],"prefix":"10.1007","volume":"19","author":[{"given":"Woocheol","family":"Choi","sequence":"first","affiliation":[]},{"given":"Changbum","family":"Chun","sequence":"additional","affiliation":[]},{"given":"Yoon Mo","family":"Jung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5782-7266","authenticated-orcid":false,"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,19]]},"reference":[{"key":"2129_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-021-01632-3","volume":"194","author":"W Huang","year":"2022","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. Math. Progr. 194, 371\u2013413 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01632-3","journal-title":"Math. Progr."},{"key":"2129_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-023-00451-w","volume":"85","author":"H Wen","year":"2023","unstructured":"Wen, H., Ke, W.: An inexact riemannian proximal gradient method. Computat. Opt. Appl. 85, 1\u201332 (2023). https:\/\/doi.org\/10.1007\/s10589-023-00451-w","journal-title":"Computat. Opt. Appl."},{"issue":"1","key":"2129_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., So, A.M.-C., Zhang, T.: Proximal gradient method for nonsmooth optimization over the stiefel manifold. SIAM J. Opt. 30(1), 210\u2013239 (2020). https:\/\/doi.org\/10.1137\/18M122457X","journal-title":"SIAM J. Opt."},{"key":"2129_CR4","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-319-25040-3_52","volume-title":"Geometric Science of Information","author":"M Genicot","year":"2015","unstructured":"Genicot, M., Huang, W., Trendafilov, N.T.: Weakly correlated sparse components with nearly orthonormal loadings. In: Nielsen, F., Barbaresco, F. (eds.) Geometric Science of Information, pp. 484\u2013490. Springer, Cham (2015)"},{"issue":"8","key":"2129_CR5","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/JPROC.2018.2846588","volume":"106","author":"H Zou","year":"2018","unstructured":"Zou, H., Xue, L.: A selective overview of sparse principal component analysis. Proc IEEE 106(8), 1311\u20131320 (2018)","journal-title":"Proc IEEE"},{"issue":"46","key":"2129_CR6","doi-asserted-by":"publisher","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozolin\u0161","year":"2013","unstructured":"Ozolin\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed modes for variational problems in mathematics and physics. Proc. Natl. Acad. Sci 110(46), 18368\u201318373 (2013). https:\/\/doi.org\/10.1073\/pnas.1318679110","journal-title":"Proc. Natl. Acad. Sci"},{"key":"2129_CR7","doi-asserted-by":"publisher","unstructured":"Wang, Q., Gao, J., Li, H.: Grassmannian manifold optimization assisted sparse spectral clustering. 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Honolulu, HI, USA, pp 3145\u20133153 (2017). https:\/\/doi.org\/10.1109\/CVPR.2017.335","DOI":"10.1109\/CVPR.2017.335"},{"key":"2129_CR8","doi-asserted-by":"crossref","unstructured":"Cherian, A., Sra, S.: Riemannian dictionary learning and sparse coding for positive definite matrices. CoRR arXiv:1507.02772 (2015)","DOI":"10.1007\/978-3-319-10578-9_20"},{"key":"2129_CR9","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Proceedings of the 24th International Conference on Neural Information Processing Systems. NIPS\u201911, pp. 1458\u20131466. Curran Associates Inc., Red Hook, NY, USA (2011)"},{"key":"2129_CR10","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Karimi","year":"2016","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the polyak-\u0142ojasiewicz condition. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer, Cham (2016)"},{"issue":"1","key":"2129_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2018","unstructured":"Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2018). https:\/\/doi.org\/10.1093\/imanum\/drx080","journal-title":"IMA J. Numer. Anal."},{"key":"2129_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-018-1285-1","volume":"178","author":"W Liu","year":"2019","unstructured":"Liu, W., So, A.M.-C., Wu, W.: Quadratic optimization with orthogonality constraint: explicit Lojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. Math. Progr. 178, 215\u2013262 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1285-1","journal-title":"Math. Progr."},{"issue":"2","key":"2129_CR13","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1016\/j.jmaa.2017.04.011","volume":"457","author":"A Daniilidis","year":"2018","unstructured":"Daniilidis, A., Deville, R., Durand-Cartagena, E., Rifford, L.: Self-contracted curves in riemannian manifolds. J. Math. Anal. Appl. 457(2), 1333\u20131352 (2018). https:\/\/doi.org\/10.1016\/j.jmaa.2017.04.011","journal-title":"J. Math. Anal. Appl."},{"key":"2129_CR14","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1137\/14099961X","volume":"25","author":"X Wang","year":"2015","unstructured":"Wang, X., Li, C., Wang, J., Yao, J.-C.: Linear convergence of subgradient algorithm for convex feasibility on riemannian manifolds. SIAM J. Opt. 25, 2334\u20132358 (2015). https:\/\/doi.org\/10.1137\/14099961X","journal-title":"SIAM J. Opt."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02129-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02129-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:11:07Z","timestamp":1742015467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02129-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,19]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2129"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02129-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,6,19]]},"assertion":[{"value":"8 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}