{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:53Z","timestamp":1740122453666,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T00:00:00Z","timestamp":1694822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T00:00:00Z","timestamp":1694822400000},"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":["11671205"],"award-info":[{"award-number":["11671205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10898-023-01326-4","type":"journal-article","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T03:24:53Z","timestamp":1694834693000},"page":"1051-1076","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proximal gradient algorithm with trust region scheme on Riemannian manifold"],"prefix":"10.1007","volume":"88","author":[{"given":"Shimin","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Tao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Yuanguo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,16]]},"reference":[{"key":"1326_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P Absil","year":"2008","unstructured":"Absil, P., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ (2008)"},{"issue":"3","key":"1326_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1326_CR3","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/21M1409536","volume":"32","author":"AY Aravkin","year":"2022","unstructured":"Aravkin, A.Y., Baraldi, R., Orban, D.: A proximal quasi-newton trust-region method for nonsmooth regularized optimization. SIAM J. Optim. 32(2), 900\u2013929 (2022)","journal-title":"SIAM J. Optim."},{"key":"1326_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Princeton, NJ (2017)"},{"key":"1326_CR5","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10957-017-1093-4","volume":"173","author":"GC Bento","year":"2017","unstructured":"Bento, G.C., Ferreira, O.P., Melo, J.G.: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. J. Optim. Theor. Appl. 173, 548\u2013562 (2017)","journal-title":"J. Optim. Theor. Appl."},{"issue":"3","key":"1326_CR6","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P.: Nonlinear programming. J. Oper. Res. Soc. 48(3), 334\u2013334 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"1326_CR7","unstructured":"Boumal, N., Absil, P.: RTRMC: a Riemannian trust-region method for low-rank matrix completion. In 24th International Conference on Neural Information Processing Systems pp. 406\u2013414 (2011)"},{"issue":"4","key":"1326_CR8","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"key":"1326_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616822","volume-title":"Riemannian Geometry","author":"I Chavel","year":"2006","unstructured":"Chavel, I.: Riemannian Geometry. Cambridge University Press, Woodbine, NJ (2006)"},{"issue":"1","key":"1326_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., So, M.C., Zhang, T.: Proximal gradient method for nonsmooth optimization over the stiefel manifold. SIAM J. Optim. 30(1), 210\u2013239 (2020)","journal-title":"SIAM J. Optim."},{"key":"1326_CR11","doi-asserted-by":"publisher","first-page":"659","DOI":"10.4208\/jcm.2110-m2020-0317","volume":"41","author":"Z Chen","year":"2023","unstructured":"Chen, Z., Milzarek, A., Wen, Z.: A trust-region method for nonsmooth nonconvex optimization. J. Comput. Math. 41, 659\u2013692 (2023)","journal-title":"J. Comput. Math."},{"issue":"2","key":"1326_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF00939608","volume":"76","author":"NY Deng","year":"1993","unstructured":"Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotonic trust region algorithm. J. Optim. Theor. Appl. 76(2), 259\u2013285 (1993)","journal-title":"J. Optim. Theor. Appl."},{"issue":"2","key":"1326_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/02331930290019413","volume":"51","author":"OP Ferreira","year":"2002","unstructured":"Ferreira, O.P., Oliveira, P.R.: Proximal point algorithm on Riemannian manifolds. Optimization 51(2), 257\u2013270 (2002)","journal-title":"Optimization"},{"key":"1326_CR14","doi-asserted-by":"crossref","unstructured":"Genicot, M., Huang, W., Trendafilov, N.T.: Weakly correlated sparse components with nearly orthonormal loadings. Geometric Science of Information pp. 484\u2013490 (2015)","DOI":"10.1007\/978-3-319-25040-3_52"},{"issue":"1\u20132","key":"1326_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"1326_CR16","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1093\/imanum\/drv043","volume":"36","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds. IMA J. Numer. Anal. 36, 1167\u20131192 (2016)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"1326_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10444-015-9426-z","volume":"42","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: $$\\varepsilon $$-subgradient algorithms for locally lipschitz functions on Riemannian manifolds. Adv. Comput. Math. 42(2), 333\u2013360 (2016)","journal-title":"Adv. Comput. Math."},{"issue":"12","key":"1326_CR18","doi-asserted-by":"publisher","first-page":"3884","DOI":"10.1016\/j.na.2011.02.023","volume":"74","author":"S Hosseini","year":"2011","unstructured":"Hosseini, S., Pouryayevali, M.R.: Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds. Nonlinear Anal. Theor. Methods Appl. 74(12), 3884\u20133895 (2011)","journal-title":"Nonlinear Anal. Theor. Methods Appl."},{"key":"1326_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"H Hotellings","year":"1933","unstructured":"Hotellings, H.: Analysis of a complex of statistical variables into principal components. Br. J. Educ. Psychol. 24, 417\u2013520 (1933)","journal-title":"Br. J. Educ. Psychol."},{"issue":"2","key":"1326_CR20","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1007\/s40305-020-00295-9","volume":"8","author":"J Hu","year":"2020","unstructured":"Hu, J., Liu, X., Wen, Z.W., Yuan, Y.X.: A brief introduction to manifold optimization. J. Oper. Res. Soc. China 8(2), 2194\u20136698 (2020)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1326_CR21","unstructured":"Huang, W.: Optimization algorithms on Riemannian manifolds with applications. Dissertations and Theses\u2013Gradworks (2013)"},{"key":"1326_CR22","first-page":"627","volume":"2015","author":"W Huang","year":"2016","unstructured":"Huang, W., Absil, P., Gallivan, K.A.: A Riemannian BFGS method for nonconvex optimization problems. Numer. Math. Adv. Appl. ENUMATH 2015, 627\u2013634 (2016)","journal-title":"Numer. Math. Adv. Appl. ENUMATH"},{"issue":"2","key":"1326_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-014-0765-1","volume":"150","author":"W Huang","year":"2015","unstructured":"Huang, W., Absil, P.A., Gallivan, K.A.: A Riemannian symmetric rank-one trust-region method. Math. Program. 150(2), 179\u2013216 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1326_CR24","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/17M1127582","volume":"28","author":"W Huang","year":"2018","unstructured":"Huang, W., Absil, P.A., Gallivan, K.A.: A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems. SIAM J. Optim. 28(1), 470\u2013495 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1326_CR25","doi-asserted-by":"publisher","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."},{"issue":"1\u20132","key":"1326_CR26","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. Program. 194(1\u20132), 371\u2013413 (2022)","journal-title":"Math. Program."},{"issue":"3","key":"1326_CR27","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Uddin, T.M.: A modified principal component technique based on the LASSO. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"key":"1326_CR28","first-page":"379","volume":"28","author":"H Li","year":"2015","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. Adv. Neural Inf. Process. Syst. 28, 379\u2013387 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"1326_CR29","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/s10589-017-9941-6","volume":"69","author":"JJ Liu","year":"2018","unstructured":"Liu, J.J., Xu, X.M., Cui, X.H.: An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization. Comput. Optim. Appl. 69(1), 1573\u20132894 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1326_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"J Mo","year":"2007","unstructured":"Mo, J., Liu, C., Yan, S.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values. J. Comput. Appl. Math. 209(1), 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"1326_CR31","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1057\/jors.1984.92","volume":"35","author":"AS Nemirovsky","year":"1984","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. J. Oper. Res. Soc. 35(5), 455\u2013455 (1984)","journal-title":"J. Oper. Res. Soc."},{"issue":"46","key":"1326_CR32","doi-asserted-by":"publisher","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozolins","year":"2013","unstructured":"Ozolins, 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)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"1326_CR33","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S., et al.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"2","key":"1326_CR34","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/11082885X","volume":"22","author":"W Ring","year":"2012","unstructured":"Ring, W., Wirth, B.: Optimization methods on Riemannian manifolds and their application to shape space. SIAM J. Optim. 22(2), 596\u2013627 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1326_CR35","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2015","unstructured":"Sato, H., Toshihiro, Iwai: A new, globally convergent Riemannian conjugate gradient method. Optimization 64(4), 1011\u20131031 (2015)","journal-title":"Optimization"},{"issue":"10","key":"1326_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v084.i10","volume":"84","author":"K Sj\u00f6strand","year":"2018","unstructured":"Sj\u00f6strand, K., Clemmensen, L.: SpaSM: a MATLAB toolbox for sparse statistical modeling. J. Stat. Softw. 84(10), 1\u201337 (2018)","journal-title":"J. Stat. Softw."},{"issue":"1","key":"1326_CR37","first-page":"159","volume":"156","author":"W Sun","year":"2004","unstructured":"Sun, W.: Nonmonotone trust region method for solving optimization problems. Appl. Math. Comput. 156(1), 159\u2013174 (2004)","journal-title":"Appl. Math. Comput."},{"key":"1326_CR38","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"WY Sun","year":"2006","unstructured":"Sun, W.Y., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer Science Business Media (2006)"},{"issue":"12","key":"1326_CR39","doi-asserted-by":"publisher","first-page":"2914","DOI":"10.1109\/TKDE.2014.2320728","volume":"26","author":"J Tang","year":"2015","unstructured":"Tang, J., Liu, H.: An unsupervised feature selection framework for social media data. IEEE Trans. Knowl. Data Eng. 26(12), 2914\u20132927 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"1326_CR40","first-page":"415","volume":"10","author":"WH Yang","year":"2014","unstructured":"Yang, W.H., Zhang, L.H., Song, R.Y.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pac. J. Optim. 10(2), 415\u2013434 (2014)","journal-title":"Pac. J. Optim."},{"key":"1326_CR41","unstructured":"Yang, Y., Shen, H.T., Ma, Z., Zi, H., Zhou, X.: $$l_{21}$$-norm regularized discriminative feature selection for unsupervised learning. In 22th international joint conference on Artificial Intelligence 2, pp. 1589\u20131594 (2011)"},{"key":"1326_CR42","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"HC Zhang","year":"2004","unstructured":"Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1326_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, Y.Q., Lau, Y., Kuo, H.W., Cheung, S., Pasupathy, A., Wright, J.: On the global geometry of sphere-constrained sparse blind deconvolution. In IEEE Conference on Computer Vision and Pattern Recognition pp. 4381\u20134389 (2017)","DOI":"10.1109\/CVPR.2017.466"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01326-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01326-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01326-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T03:19:13Z","timestamp":1711855153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01326-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,16]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1326"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01326-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2023,9,16]]},"assertion":[{"value":"20 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}