{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T20:25:51Z","timestamp":1773174351378,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"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":["72394365"],"award-info":[{"award-number":["72394365"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10589-024-00595-3","type":"journal-article","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T21:02:01Z","timestamp":1722027721000},"page":"419-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold"],"prefix":"10.1007","volume":"89","author":[{"given":"Qinsi","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1309-8209","authenticated-orcid":false,"given":"Wei Hong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"595_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-11370-4_1","volume":"170","author":"P-A Absil","year":"2019","unstructured":"Absil, P.-A., Hosseini, S.: A collection of nonsmooth Riemannian optimization problems. Int. Ser. Numer. Math. 170, 1\u201315 (2019). https:\/\/doi.org\/10.1007\/978-3-030-11370-4_1","journal-title":"Int. Ser. Numer. Math."},{"issue":"1","key":"595_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"P-A Absil","year":"2012","unstructured":"Absil, P.-A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012). https:\/\/doi.org\/10.1137\/100802529","journal-title":"SIAM J. Optim."},{"key":"595_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization algorithms on matrix manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, Princeton (2008)"},{"issue":"2","key":"595_CR4","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). https:\/\/doi.org\/10.1137\/21M1409536","journal-title":"SIAM J. Optim."},{"key":"595_CR5","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.cam.2013.07.002","volume":"255","author":"PB Borckmans","year":"2014","unstructured":"Borckmans, P.B., Easter Selvan, S., Boumal, N., Absil, P.-A.: A Riemannian subgradient algorithm for economic dispatch with valve-point effect. J. Comput. Appl. Math. 255, 848\u2013866 (2014). https:\/\/doi.org\/10.1016\/j.cam.2013.07.002","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"595_CR6","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. Optim. 30(1), 210\u2013239 (2020). https:\/\/doi.org\/10.1137\/18M122457X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"595_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/15M1052834","volume":"55","author":"X Chen","year":"2017","unstructured":"Chen, X., Guo, L., Lu, Z., Ye, J.J.: An augmented Lagrangian method for non-Lipschitz nonconvex programming. SIAM J. Numer. Anal. 55(1), 168\u2013193 (2017). https:\/\/doi.org\/10.1137\/15M1052834","journal-title":"SIAM J. Numer. Anal."},{"key":"595_CR8","first-page":"139","volume":"15","author":"Y-H Dai","year":"2002","unstructured":"Dai, Y.-H.: A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. Syst. Sci. Complex. 15, 139\u2013145 (2002)","journal-title":"J. Syst. Sci. Complex."},{"issue":"1","key":"595_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1022675100677","volume":"97","author":"O Ferreira","year":"1998","unstructured":"Ferreira, O., Oliveira, P.: Subgradient algorithm on Riemannian manifolds. J. Optim. Theory Appl. 97(1), 93\u2013104 (1998). https:\/\/doi.org\/10.1023\/A:1022675100677","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"595_CR10","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.-X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), 1949\u20131983 (2019). https:\/\/doi.org\/10.1137\/18M1221679","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"595_CR11","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-017-9964-z","volume":"69","author":"H Ghanbari","year":"2018","unstructured":"Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69(3), 597\u2013627 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9964-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"595_CR12","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/16M1087801","volume":"27","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with H\u00f6lder continuous Hessians. SIAM J. Optim. 27(1), 478\u2013506 (2017). https:\/\/doi.org\/10.1137\/16M1087801","journal-title":"SIAM J. Optim."},{"issue":"1","key":"595_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/17M1142077","volume":"29","author":"GN Grapiglia","year":"2019","unstructured":"Grapiglia, G.N., Nesterov, Y.: Accelerated regularized Newton methods for minimizing composite convex functions. SIAM J. Optim. 29(1), 77\u201399 (2019). https:\/\/doi.org\/10.1137\/17M1142077","journal-title":"SIAM J. Optim."},{"issue":"4","key":"595_CR14","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986). https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"595_CR15","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). https:\/\/doi.org\/10.1007\/s10444-015-9426-z","journal-title":"Adv. Comput. Math."},{"issue":"12","key":"595_CR16","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. Theory Methods Appl. 74(12), 3884\u20133895 (2011). https:\/\/doi.org\/10.1016\/j.na.2011.02.023","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"issue":"3","key":"595_CR17","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2018","unstructured":"Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive quadratically regularized Newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2018). https:\/\/doi.org\/10.1137\/17M1142478","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"595_CR18","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, 371\u2013413 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01632-3","journal-title":"Math. Program."},{"issue":"1","key":"595_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-023-00451-w","volume":"85","author":"W Huang","year":"2023","unstructured":"Huang, W., Wei, K.: An inexact Riemannian proximal gradient method. Comput. Optim. Appl. 85(1), 1\u201332 (2023). https:\/\/doi.org\/10.1007\/s10589-023-00451-w","journal-title":"Comput. Optim. Appl."},{"key":"595_CR20","unstructured":"Huang, W., Wei, M., Gallivan, K.A., Dooren, P.V.: A Riemannian optimization approach to clustering problems. ArXiv (2022) arXiv:2208.03858"},{"key":"595_CR21","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-319-46454-1_41","volume-title":"Computer vision\u2013ECCV 2016","author":"A Kovnatsky","year":"2016","unstructured":"Kovnatsky, A., Glashoff, K., Bronstein, M.M.: MADMM: a generic algorithm for non-smooth optimization on manifolds. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) Computer vision\u2013ECCV 2016, pp. 680\u2013696. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46454-1_41"},{"issue":"2","key":"595_CR22","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014). https:\/\/doi.org\/10.1007\/s10915-013-9740-x","journal-title":"J. Sci. Comput."},{"issue":"3","key":"595_CR23","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014). https:\/\/doi.org\/10.1137\/130921428","journal-title":"SIAM J. Optim."},{"key":"595_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-018-1285-1","volume":"178","author":"H Liu","year":"2019","unstructured":"Liu, H., Wu, W., So, A.M.-C.: Quadratic optimization with orthogonality constraints: explicit \u0141ojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. Math. Program. 178, 215\u2013262 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1285-1","journal-title":"Math. Program."},{"key":"595_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108, 177\u2013205 (2006). https:\/\/doi.org\/10.1007\/s10107-006-0706-8","journal-title":"Math. Program."},{"key":"595_CR26","series-title":"Springer series in operations research and financial engineering","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer series in operations research and financial engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"46","key":"595_CR27","doi-asserted-by":"publisher","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozoli\u0146\u0161","year":"2013","unstructured":"Ozoli\u0146\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed modes for variational problems in mathematics and physics. Proc. Natl. Acad. Sci. U.S.A. 110(46), 18368\u201318373 (2013). https:\/\/doi.org\/10.1073\/pnas.1318679110","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"1","key":"595_CR28","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01588967","volume":"14","author":"MJ Powell","year":"1978","unstructured":"Powell, M.J.: Algorithms for nonlinear constraints that use Lagrangian functions. Math. Program. 14(1), 224\u2013248 (1978). https:\/\/doi.org\/10.1007\/BF01588967","journal-title":"Math. Program."},{"issue":"1","key":"595_CR29","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/23M1565097","volume":"34","author":"W Si","year":"2024","unstructured":"Si, W., Absil, P.-A., Huang, W., Jiang, R., Vary, S.: A Riemannian proximal Newton method. SIAM J. Optim. 34(1), 654\u2013681 (2024). https:\/\/doi.org\/10.1137\/23M1565097","journal-title":"SIAM J. Optim."},{"key":"595_CR30","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10915-023-02165-x","volume":"95","author":"Q Wang","year":"2023","unstructured":"Wang, Q., Yang, W.H.: Proximal quasi-Newton method for composite optimization over the Stiefel manifold. J. Sci. Comput. 95, 39 (2023). https:\/\/doi.org\/10.1007\/s10915-023-02165-x","journal-title":"J. Sci. Comput."},{"issue":"2","key":"595_CR31","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/15M1053141","volume":"27","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Goldfarb, D., Liu, W.: Stochastic quasi-Newton methods for nonconvex stochastic optimization. SIAM J. Optim. 27(2), 927\u2013956 (2017). https:\/\/doi.org\/10.1137\/15M1053141","journal-title":"SIAM J. Optim."},{"key":"595_CR32","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142, 397\u2013434 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0584-1","journal-title":"Math. Program."},{"issue":"1","key":"595_CR33","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.W.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018). https:\/\/doi.org\/10.1007\/s10915-017-0624-3","journal-title":"J. Sci. Comput."},{"key":"595_CR34","first-page":"415","volume":"10","author":"WH Yang","year":"2014","unstructured":"Yang, W.H., Zhang, L., Song, R.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pac. J. Optim. 10, 415\u2013434 (2014)","journal-title":"Pac. J. Optim."},{"key":"595_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01898-1","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Bao, C., Ding, C., Zhu, J.-L.: A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01898-1","journal-title":"Math. Program."},{"issue":"2","key":"595_CR36","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006). https:\/\/doi.org\/10.1198\/106186006X113430","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00595-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00595-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00595-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T12:12:30Z","timestamp":1728389550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00595-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,26]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["595"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00595-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,26]]},"assertion":[{"value":"10 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}