{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:57:28Z","timestamp":1776412648177,"version":"3.51.2"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"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":["12371099"],"award-info":[{"award-number":["12371099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371099"],"award-info":[{"award-number":["12371099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s11075-025-02120-x","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T07:02:26Z","timestamp":1749452546000},"page":"25-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Regularized Barzilai-Borwein Method"],"prefix":"10.1007","volume":"102","author":[{"given":"Congpei","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"2120_CR1","first-page":"536","volume":"25","author":"A-L Cauchy","year":"1847","unstructured":"Cauchy, A.-L.: M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des syst\u00e8mes d\u2019\u00e9quations simultan\u00e9es. Comp. Rend. Sci. Paris. 25, 536\u2013538 (1847)","journal-title":"Comp. Rend. Sci. Paris."},{"issue":"1","key":"2120_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/bf01831719","volume":"11","author":"H Akaike","year":"1959","unstructured":"Akaike, H.: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Stat. Math. 11(1), 1\u201316 (1959). https:\/\/doi.org\/10.1007\/bf01831719","journal-title":"Ann. Inst. Stat. Math."},{"key":"2120_CR3","doi-asserted-by":"publisher","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming, 1st edn. Springer, New York (2006). https:\/\/doi.org\/10.1007\/b106451","DOI":"10.1007\/b106451"},{"key":"2120_CR4","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"issue":"1","key":"2120_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-Point Step Size Gradient Methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"2120_CR6","doi-asserted-by":"publisher","unstructured":"Golub, G.H., Van\u00a0Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Philadelphia, PA (2013). https:\/\/doi.org\/10.1137\/1.9781421407944","DOI":"10.1137\/1.9781421407944"},{"issue":"3","key":"2120_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10589-022-00349-z","volume":"81","author":"Y Huang","year":"2022","unstructured":"Huang, Y., Dai, Y., Liu, X., Zhang, H.: On the acceleration of the Barzilai-Borwein method. Comput. Optim. Appl. 81(3), 717\u2013740 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00349-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2120_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1998","unstructured":"Friedlander, A., Mart\u00ednez, J.M., Molina, B., Raydan, M.: Gradient Method with Retards and Generalizations. SIAM J. Numer. Anal. 36(1), 275\u2013289 (1998). https:\/\/doi.org\/10.1137\/S003614299427315X","journal-title":"SIAM J. Numer. Anal."},{"key":"2120_CR9","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: On the Barzilai-Borwein Method. In: L.\u00a0Qi, K.T., Yang, X. (eds.) Optimization and Control with Applications, pp. 235\u2013256. Springer, Boston, MA, USA (2005)","DOI":"10.1007\/0-387-24255-4_10"},{"key":"2120_CR10","unstructured":"Yuan, Y.: Step-Sizes for the Gradient Method. Third International Congress of Chinese Mathematicians, pp. 785\u2013796 (2018)"},{"issue":"3","key":"2120_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13(3), 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"2120_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"Y Dai","year":"2002","unstructured":"Dai, Y., Liao, L.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22(1), 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"2120_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/bf02143126","volume":"13","author":"B Molina","year":"1996","unstructured":"Molina, B., Raydan, M.: Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations. Numer. Algorithms 13(1), 45\u201360 (1996). https:\/\/doi.org\/10.1007\/bf02143126","journal-title":"Numer. Algorithms"},{"issue":"3","key":"2120_CR14","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10107-004-0516-9","volume":"103","author":"Y Dai","year":"2005","unstructured":"Dai, Y., Fletcher, R.: On the Asymptotic Behaviour of Some New Gradient Methods. Math. Program. 103(3), 541\u2013559 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0516-9","journal-title":"Math. Program."},{"issue":"1","key":"2120_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.: Gradient Methods with Adaptive Step-Sizes. Comput. Optim. Appl. 35(1), 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2120_CR16","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"Y Dai","year":"2006","unstructured":"Dai, Y., Hager, W.W., Schittkowski, K., Zhang, H.: The cyclic Barzilai-Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26(3), 604\u2013627 (2006). https:\/\/doi.org\/10.1093\/imanum\/drl006","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"2120_CR17","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1137\/21M1390785","volume":"31","author":"Y Huang","year":"2021","unstructured":"Huang, Y., Dai, Y., Liu, X.: Equipping the Barzilai-Borwein Method with the Two Dimensional Quadratic Termination Property. SIAM J. Optim. 31(4), 3068\u20133096 (2021). https:\/\/doi.org\/10.1137\/21M1390785","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2120_CR18","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s10589-023-00546-4","volume":"87","author":"S Li","year":"2024","unstructured":"Li, S., Zhang, T., Xia, Y.: A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares. Comput. Optim. Appl. 87(3), 1011\u20131031 (2024). https:\/\/doi.org\/10.1007\/s10589-023-00546-4","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2120_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/s1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem. SIAM J. Optim. 7(1), 26\u201333 (1997). https:\/\/doi.org\/10.1137\/s1052623494266365","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2120_CR20","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)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"2120_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"Y Dai","year":"2005","unstructured":"Dai, Y., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005). https:\/\/doi.org\/10.1007\/s00211-004-0569-y","journal-title":"Numer. Math."},{"issue":"3","key":"2120_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y Dai","year":"2005","unstructured":"Dai, Y., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0595-2","journal-title":"Math. Program."},{"issue":"4","key":"2120_CR23","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1137\/17m1128538","volume":"28","author":"D Di Serafino","year":"2018","unstructured":"Di Serafino, D., Toraldo, G., Viola, M., Barlow, J.: A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables. SIAM J. Optim. 28(4), 2809\u20132838 (2018). https:\/\/doi.org\/10.1137\/17m1128538","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2120_CR24","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/19m1268641","volume":"30","author":"S Crisci","year":"2020","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: Spectral Properties of Barzilai-Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds. SIAM J. Optim. 30(2), 1300\u20131326 (2020). https:\/\/doi.org\/10.1137\/19m1268641","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2120_CR25","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s10957-018-1434-y","volume":"181","author":"H Mohammad","year":"2018","unstructured":"Mohammad, H., Waziri, M.Y.: Structured Two-Point Stepsize Gradient Methods for Nonlinear Least Squares. J. Optim. Theory Appl. 181(1), 298\u2013317 (2018). https:\/\/doi.org\/10.1007\/s10957-018-1434-y","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2120_CR26","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Problems 25(1), 015002 (2009). https:\/\/doi.org\/10.1088\/0266-5611\/25\/1\/015002","journal-title":"Inverse Problems"},{"issue":"1","key":"2120_CR27","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s11227-023-05500-z","volume":"80","author":"H Jalilian","year":"2023","unstructured":"Jalilian, H.: Total variation method based on modified Barzilai-Borwein algorithm to noise reduction in MRI images. J. Supercomput. 80(1), 601\u2013619 (2023). https:\/\/doi.org\/10.1007\/s11227-023-05500-z","journal-title":"J. Supercomput."},{"key":"2120_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.apnum.2019.10.008","volume":"150","author":"C An","year":"2020","unstructured":"An, C., Xiao, Y.: Numerical construction of spherical t-designs by Barzilai-Borwein method. Appl. Numer. Math. 150, 295\u2013302 (2020). https:\/\/doi.org\/10.1016\/j.apnum.2019.10.008","journal-title":"Appl. Numer. Math."},{"key":"2120_CR29","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10107-011-0479-6","volume":"135","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R.: A limited memory steepest descent method. Math. Program. 135, 413\u2013436 (2012). https:\/\/doi.org\/10.1007\/s10107-011-0479-6","journal-title":"Math. Program."},{"issue":"1","key":"2120_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/S0895479897326432","volume":"21","author":"GH Golub","year":"1999","unstructured":"Golub, G.H., Hansen, P.C., O\u2019Leary, D.P.: Tikhonov Regularization and Total Least Squares. SIAM J. Matrix Anal. Appl. 21(1), 185\u2013194 (1999). https:\/\/doi.org\/10.1137\/S0895479897326432","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2120_CR31","doi-asserted-by":"publisher","unstructured":"Lu, S., Pereverzev, S.V.: Regularization Theory for Ill-posed Problems: Selected Topics. De Gruyter, Berlin (2013). https:\/\/doi.org\/10.1515\/9783110286496","DOI":"10.1515\/9783110286496"},{"issue":"3","key":"2120_CR32","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10589-014-9669-5","volume":"59","author":"R De Asmundis","year":"2014","unstructured":"De Asmundis, R., Serafino, D., Hager, W.W., Toraldo, G., Zhang, H.: An efficient gradient method using the Yuan steplength. Comput. Optim. Appl. 59(3), 541\u2013563 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9669-5","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2120_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"issue":"2","key":"2120_CR34","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/s0377-0427(99)00276-9","volume":"114","author":"MN Vrahatis","year":"2000","unstructured":"Vrahatis, M.N., Androulakis, G.S., Lambrinos, J.N., Magoulas, G.D.: A class of gradient unconstrained minimization algorithms with adaptive stepsize. J. Comput. Appl. Math. 114(2), 367\u2013386 (2000). https:\/\/doi.org\/10.1016\/s0377-0427(99)00276-9","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2120_CR35","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/bf02165472","volume":"11","author":"GE Forsythe","year":"1968","unstructured":"Forsythe, G.E.: On the asymptotic directions of the s-dimensional optimum gradient method. Numer. Math. 11(1), 57\u201376 (1968). https:\/\/doi.org\/10.1007\/bf02165472","journal-title":"Numer. Math."},{"issue":"2","key":"2120_CR36","first-page":"149","volume":"24","author":"Y Yuan","year":"2006","unstructured":"Yuan, Y.: A new stepsize for the steepest descent method. J. Comput. Math. 24(2), 149\u2013156 (2006)","journal-title":"J. Comput. Math."},{"issue":"2","key":"2120_CR37","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati, G., Zanni, L., Zanghirati, G.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4(2), 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"issue":"4\u20135","key":"2120_CR38","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"Y Dai","year":"2003","unstructured":"Dai, Y.: Alternate step gradient method. Optimization 52(4\u20135), 395\u2013415 (2003). https:\/\/doi.org\/10.1080\/02331930310001611547","journal-title":"Optimization"},{"key":"2120_CR39","doi-asserted-by":"publisher","unstructured":"Li, X., Huang, Y.: A Note on R-Linear Convergence of Nonmonotone Gradient Methods. J. Oper. Res. Soc. China 1\u201313 (2023). https:\/\/doi.org\/10.1007\/s40305-023-00468-2","DOI":"10.1007\/s40305-023-00468-2"},{"issue":"2","key":"2120_CR40","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/a:1013653923062","volume":"112","author":"Y Dai","year":"2002","unstructured":"Dai, Y.: On the Nonmonotone Line Search. J. Optim. Theory Appl. 112(2), 315\u2013330 (2002). https:\/\/doi.org\/10.1023\/a:1013653923062","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2120_CR41","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.amc.2017.07.037","volume":"318","author":"D Di Serafino","year":"2018","unstructured":"Di Serafino, D., Ruggiero, V., Toraldo, G., Zanni, L.: On the steplength selection in gradient methods for unconstrained optimization. Appl. Math. Comput. 318(1), 176\u2013195 (2018). https:\/\/doi.org\/10.1016\/j.amc.2017.07.037","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"2120_CR42","doi-asserted-by":"publisher","first-page":"916","DOI":"10.4208\/jcm.1911-m2019-0171","volume":"37","author":"O Burdakov","year":"2019","unstructured":"Burdakov, O., Dai, Y., Huang, N.: Stabilized Barzilai-Borwein Method. J. Comput. Math. 37(6), 916\u2013936 (2019). https:\/\/doi.org\/10.4208\/jcm.1911-m2019-0171","journal-title":"J. Comput. Math."},{"issue":"2","key":"2120_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"1","key":"2120_CR44","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"Y Dai","year":"2019","unstructured":"Dai, Y., Huang, Y., Liu, X.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74(1), 43\u201365 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00107-8","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2120_CR45","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10589-023-00455-6","volume":"85","author":"G Ferrandi","year":"2023","unstructured":"Ferrandi, G., Hochstenbach, M.E., Kreji\u0107, N.: A harmonic framework for stepsize selection in gradient methods. Comput. Optim. Appl. 85(1), 75\u2013106 (2023). https:\/\/doi.org\/10.1007\/s10589-023-00455-6","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2120_CR46","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"HH Rosenbrock","year":"1960","unstructured":"Rosenbrock, H.H.: An Automatic Method for Finding the Greatest or Least Value of a Function. Comput. J. 3(3), 175\u2013184 (1960). https:\/\/doi.org\/10.1093\/comjnl\/3.3.175","journal-title":"Comput. J."},{"issue":"1","key":"2120_CR47","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An Unconstrained Optimization Test Functions Collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"issue":"1","key":"2120_CR48","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing Unconstrained Optimization Software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981). https:\/\/doi.org\/10.1145\/355934.355936","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"2120_CR49","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P Delsarte","year":"1977","unstructured":"Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Comb. 6(3), 363\u2013388 (1977). https:\/\/doi.org\/10.1007\/BF03187604","journal-title":"Spherical codes and designs. Geom. Comb."},{"issue":"6","key":"2120_CR50","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1137\/100795140","volume":"48","author":"C An","year":"2010","unstructured":"An, C., Chen, X., Sloan, I.H., Womersley, R.S.: Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere. SIAM J. Numer. Anal. 48(6), 2135\u20132157 (2010). https:\/\/doi.org\/10.1137\/100795140","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"2120_CR51","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1016\/j.ejc.2008.11.007","volume":"30","author":"E Bannai","year":"2009","unstructured":"Bannai, E., Bannai, E.: A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Comb. 30(6), 1392\u20131425 (2009). https:\/\/doi.org\/10.1016\/j.ejc.2008.11.007","journal-title":"Eur. J. Comb."},{"issue":"2","key":"2120_CR52","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jat.2009.02.014","volume":"159","author":"IH Sloan","year":"2009","unstructured":"Sloan, I.H., Womersley, R.S.: A variational characterisation of spherical designs. J. Approx. Theory 159(2), 308\u2013318 (2009). https:\/\/doi.org\/10.1016\/j.jat.2009.02.014","journal-title":"J. Approx. Theory"},{"key":"2120_CR53","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, NJ (2008)"},{"issue":"2","key":"2120_CR54","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00211-010-0332-5","volume":"117","author":"X Chen","year":"2010","unstructured":"Chen, X., Frommer, A., Lang, B.: Computational existence proofs for spherical t-designs. Numer. Math. 117(2), 289\u2013305 (2010). https:\/\/doi.org\/10.1007\/s00211-010-0332-5","journal-title":"Numer. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02120-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02120-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02120-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:17:38Z","timestamp":1776410258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02120-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2120"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02120-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"19 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}