{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:35:16Z","timestamp":1768973716083,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"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":["12021001"],"award-info":[{"award-number":["12021001"]}],"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":["11991021"],"award-info":[{"award-number":["11991021"]}],"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":["11991020"],"award-info":[{"award-number":["11991020"]}],"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":["11971372"],"award-info":[{"award-number":["11971372"]}],"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":["11631013"],"award-info":[{"award-number":["11631013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDA27000000"],"award-info":[{"award-number":["XDA27000000"]}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2021YFA1000300"],"award-info":[{"award-number":["2021YFA1000300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2021YFA1000301"],"award-info":[{"award-number":["2021YFA1000301"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10589-023-00495-y","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T21:01:29Z","timestamp":1686171689000},"page":"753-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Greedy PSB methods with explicit superlinear convergence"],"prefix":"10.1007","volume":"85","author":[{"given":"Zhen-Yuan","family":"Ji","sequence":"first","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"495_CR1","doi-asserted-by":"crossref","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. general considerations. IMA J. Appl. Math. 6, 76\u201390 (1970)","DOI":"10.1093\/imamat\/6.1.76"},{"issue":"3","key":"495_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1093\/imamat\/12.3.223","volume":"12","author":"CG Broyden","year":"1973","unstructured":"Broyden, C.G., Dennis, J.E., Mor\u00e9, J.J.: On the local and superlinear convergence of quasi-Newton methods. IMA J. Appl. Math. 12(3), 223\u2013245 (1973)","journal-title":"IMA J. Appl. Math."},{"key":"495_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"RH Byrd","year":"1987","unstructured":"Byrd, R.H., Nocedal, J., Yuan, Y.Y.: Global convergence of a class of quasi-Newton methods on convex problem. SIAM J. Numer. Anal. 24, 1171\u20131190 (1987)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"495_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0802026","volume":"2","author":"RH Byrd","year":"1992","unstructured":"Byrd, R.H., Liu, D.C., Nocedal, J.: On the behavior of Broyden\u2019s class of quasi-Newton methods. SIAM J. Optim. 2(4), 533\u2013557 (1992)","journal-title":"SIAM J. Optim."},{"key":"495_CR5","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S1052623493252985","volume":"6","author":"RH Byrd","year":"1996","unstructured":"Byrd, R.H., Khalfan, H.F., Schnabel, R.B.: Analysis of a symmetric rank-one trust region method. SIAM J. Optim. 6, 1025\u20131039 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"495_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01594934","volume":"50","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. 50(1\u20133), 177\u2013195 (1991)","journal-title":"Math. Program."},{"key":"495_CR7","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1137\/S1052623401383455","volume":"13","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H.: Convergence properties of the BFGS algorithm. SIAM J. Optim. 13, 693\u2013701 (2003)","journal-title":"SIAM J. Optim."},{"key":"495_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-012-0522-2","volume":"138","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H.: A perfect example for the BFGS method. Math. Program. 138, 501\u2013530 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"495_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0801001","volume":"1","author":"WC Davidon","year":"1991","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optim. 1(1), 1\u201317 (1991)","journal-title":"SIAM J. Optim."},{"issue":"126","key":"495_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"JE Dennis","year":"1974","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comp. 28(126), 549\u2013560 (1974)","journal-title":"Math. Comp."},{"issue":"1","key":"495_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01584554","volume":"2","author":"LCW Dixon","year":"1972","unstructured":"Dixon, L.C.W.: Quasi-Newton algorithms generate identical points. Math. Program. 2(1), 383\u2013387 (1972)","journal-title":"Math. Program."},{"issue":"109","key":"495_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"G Donald","year":"1970","unstructured":"Donald, G.: A family of variable-metric methods derived by variational means. Math. Compt. 24(109), 23\u201326 (1970)","journal-title":"Math. Compt."},{"issue":"1","key":"495_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1137\/0801005","volume":"1","author":"J Engels","year":"1991","unstructured":"Engels, J., Mart\u00ednez, H.: Local and superlinear convergence for partially known quasi-Newton methods. SIAM J. Optim. 1(1), 42\u201356 (1991)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"495_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6(2), 163\u2013168 (1963)","journal-title":"Comput. J."},{"issue":"3","key":"495_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13(3), 317\u2013322 (1970)","journal-title":"Comput. J."},{"issue":"1","key":"495_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/10556788.2018.1510927","volume":"34","author":"W Gao","year":"2019","unstructured":"Gao, W., Goldfarb, D.: Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. Optim. Methods Softw. 34(1), 194\u2013217 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"11","key":"495_CR17","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/JPROC.2020.3023660","volume":"108","author":"Q Jin","year":"2020","unstructured":"Jin, Q., Mokhtari, A.: Non-asymptotic superlinear convergence of standard Quasi-Newton methods. Proc. IEEE 108(11), 1906\u20131922 (2020)","journal-title":"Proc. IEEE"},{"key":"495_CR18","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11, 1054\u20131064 (2001)","journal-title":"SIAM J. Optim."},{"key":"495_CR19","unstructured":"Lin, D.C., Ye, H.S., Zhang, Z.H.: Faster Explicit Superlinear Convergence for Greedy and Random Quasi-Newton Methods (2021). arXiv:2003.13607"},{"key":"495_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0421-7","volume":"99","author":"WF Mascarenhas","year":"2004","unstructured":"Mascarenhas, W.F.: The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. 99, 49\u201361 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"495_CR21","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/17M1122943","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Eisen, M., Ribeiro, A.: IQN: an incremental quasi-Newton method with local superlinear convergence rate. SIAM J. Optim. 28(2), 1670\u20131698 (2018)","journal-title":"SIAM J. Optim."},{"key":"495_CR22","first-page":"523","volume":"30","author":"JJ Mor\u00e9","year":"1976","unstructured":"Mor\u00e9, J.J., Trangenstein, J.A.: On the global convergence of Broyden\u2019s method. Math. Comput. 30, 523\u2013540 (1976)","journal-title":"Math. Comput."},{"key":"495_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J., Mikosch, T.V., et al.: Numerical Optimization. Springer, New York (1999)"},{"key":"495_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear Programming","author":"MJD Powell","year":"1970","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201366. Academic Press, New York (1970)"},{"issue":"1","key":"495_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1093\/imamat\/7.1.21","volume":"7","author":"MJD Powell","year":"1971","unstructured":"Powell, M.J.D.: On the convergence of the variable metric algorithm. IMA J. Appl. Math. 7(1), 21\u201336 (1971)","journal-title":"IMA J. Appl. Math."},{"key":"495_CR26","first-page":"1","volume-title":"Nonlinear Programming 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2, pp. 1\u201327. Academic Press, New York (1975)"},{"issue":"1","key":"495_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1093\/imanum\/drp021","volume":"30","author":"MJD Powell","year":"2010","unstructured":"Powell, M.J.D.: On the convergence of a wide range of trust region methods for unconstrained optimization. IMA J. Numer. Anal. 30(1), 289\u2013301 (2010)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"495_CR28","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1137\/20M1320651","volume":"31","author":"A Rodomanov","year":"2021","unstructured":"Rodomanov, A., Nesterov, Y.: Greedy quasi-newton methods with explicit superlinear convergence. SIAM J. Optim. 31(1), 785\u2013811 (2021)","journal-title":"SIAM J. Optim."},{"key":"495_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01622-5","author":"A Rodomanov","year":"2021","unstructured":"Rodomanov, A., Nesterov, Y.: Rates of superlinear convergence for classical quasi-newton methods. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01622-5","journal-title":"Math. Program."},{"key":"495_CR30","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/s10957-020-01805-8","volume":"188","author":"A Rodomanov","year":"2021","unstructured":"Rodomanov, A., Nesterov, Y.: New results on superlinear convergence of classical Quasi-Newton methods. J. Optim. Theory Appl. 188, 744\u2013769 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"495_CR31","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-newton methods for function minimization. Math. Comp. 24, 647\u2013656 (1970)","journal-title":"Math. Comp."},{"key":"495_CR32","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, New York (2006)"},{"issue":"4","key":"495_CR33","first-page":"541","volume":"39","author":"H Yabe","year":"1996","unstructured":"Yabe, H., Yamaki, N.: Local and superlinear convergence of structured Quasi-Newton methods for nonlinear optimization. J. Oper. Res. Soc. Japan. 39(4), 541\u2013557 (1996)","journal-title":"J. Oper. Res. Soc. Japan."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00495-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00495-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00495-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:55:50Z","timestamp":1688489750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00495-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00495-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"30 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","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 declare that they have no confict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}