{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:16:22Z","timestamp":1769847382708,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10589-025-00665-0","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T12:29:20Z","timestamp":1740400160000},"page":"283-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Speeding up L-BFGS by direct approximation of the inverse Hessian matrix"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9501-7047","authenticated-orcid":false,"given":"Ashkan","family":"Sadeghi-Lotfabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6043-1820","authenticated-orcid":false,"given":"Kamaledin","family":"Ghiasi-Shirazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"issue":"1","key":"665_CR1","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. general considerations. IMA J. Appl. Math. 6(1), 76\u201390 (1970)","journal-title":"IMA J. Appl. Math."},{"issue":"3","key":"665_CR2","doi-asserted-by":"crossref","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":"109","key":"665_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comput. 24(109), 23\u201326 (1970)","journal-title":"Math. Comput."},{"issue":"111","key":"665_CR4","doi-asserted-by":"crossref","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. Comput. 24(111), 647\u2013656 (1970)","journal-title":"Math. Comput."},{"issue":"1\u20133","key":"665_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(1\u20133), 129\u2013156 (1994). https:\/\/doi.org\/10.1007\/BF01582063","journal-title":"Math. Program."},{"issue":"1\u20133","key":"665_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1\u20133), 503\u2013528 (1989). https:\/\/doi.org\/10.1007\/BF01589116","journal-title":"Math. Program."},{"issue":"151","key":"665_CR7","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"665_CR8","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2e edn. Springer, New York (2006)","edition":"2e"},{"issue":"11","key":"665_CR9","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/JPROC.2020.3023660","volume":"108","author":"A Mokhtari","year":"2020","unstructured":"Mokhtari, A., Ribeiro, A.: Stochastic quasi-Newton methods. Proc. IEEE 108(11), 1906\u20131922 (2020). https:\/\/doi.org\/10.1109\/JPROC.2020.3023660","journal-title":"Proc. IEEE"},{"key":"665_CR10","unstructured":"Moritz, P., Nishihara, R., Jordan, M.: A linearly-convergent stochastic L-BFGS algorithm. In: Artificial Intelligence and Statistics, pp. 249\u2013258. PMLR"},{"issue":"1","key":"665_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/19M1240794","volume":"30","author":"Y Xie","year":"2020","unstructured":"Xie, Y., Byrd, R.H., Nocedal, J.: Analysis of the BFGS method with errors. SIAM J. Optim. 30(1), 182\u2013209 (2020)","journal-title":"SIAM J. Optim."},{"key":"665_CR12","first-page":"1737","volume":"10","author":"A Bordes","year":"2009","unstructured":"Bordes, A., Bottou, L., Gallinari, P.: Sgd-qn: Careful quasi-Newton stochastic gradient descent. J. Mach. Learn. Res. 10, 1737\u20131754 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"23","key":"665_CR13","doi-asserted-by":"crossref","first-page":"6089","DOI":"10.1109\/TSP.2014.2357775","volume":"62","author":"A Mokhtari","year":"2014","unstructured":"Mokhtari, A., Ribeiro, A.: Res: regularized stochastic BFGS algorithm. IEEE Trans. Signal Process. 62(23), 6089\u20136104 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"665_CR14","unstructured":"Schraudolph, N.N., Yu, J., G\u00fcnter, S.: A stochastic quasi-Newton method for online convex optimization. In: Artificial Intelligence and Statistics, 436\u2013443. PMLR"},{"issue":"2","key":"665_CR15","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1137\/16M1101702","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Gurbuzbalaban, M., Ribeiro, A.: Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. SIAM J. Optim. 28(2), 1420\u20131447 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"665_CR16","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M Gurbuzbalaban","year":"2017","unstructured":"Gurbuzbalaban, M., Ozdaglar, A., Parrilo, P.A.: On the convergence rate of incremental aggregated gradient algorithms. SIAM J. Optim. 27(2), 1035\u20131048 (2017)","journal-title":"SIAM J. Optim."},{"key":"665_CR17","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural. Inf. Process. Syst. 26, 315\u2013323 (2013)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"665_CR18","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"issue":"1\u20132","key":"665_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017)","journal-title":"Math. Program."},{"issue":"11","key":"665_CR20","doi-asserted-by":"publisher","first-page":"3338","DOI":"10.1109\/TNNLS.2019.2891088","volume":"30","author":"D Chang","year":"2019","unstructured":"Chang, D., Sun, S., Zhang, C.: An accelerated linearly convergent stochastic L-BFGS algorithm. IEEE Trans. Neural Netw. Learn. Syst. 30(11), 3338\u20133346 (2019). https:\/\/doi.org\/10.1109\/TNNLS.2019.2891088","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"665_CR21","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."},{"issue":"11","key":"665_CR22","doi-asserted-by":"publisher","first-page":"4776","DOI":"10.1109\/TNNLS.2019.2957843","volume":"31","author":"H Chen","year":"2020","unstructured":"Chen, H., Wu, H.C., Chan, S.C., Lam, W.H.: A stochastic quasi-Newton method for large-scale nonconvex optimization with applications. IEEE Trans. Neural Netw. Learn. Syst. 31(11), 4776\u20134790 (2020). https:\/\/doi.org\/10.1109\/TNNLS.2019.2957843","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"665_CR23","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). https:\/\/doi.org\/10.1137\/17M1122943","journal-title":"SIAM J. Optim."},{"issue":"7","key":"665_CR24","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1080\/02331934.2022.2048381","volume":"72","author":"M Javad Ebadi","year":"2023","unstructured":"Javad Ebadi, M., Fahs, A., Fahs, H., Dehghani, R.: Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization. Optimization 72(7), 1691\u20131706 (2023)","journal-title":"Optimization"},{"key":"665_CR25","unstructured":"Gao, Z., Koppel, A., Ribeiro, A.: Incremental greedy BFGS: an incremental quasi-Newton method with explicit superlinear rate. In: Adv. Neural Inf. Process. Syst. 12th OPT Workshop Optim. Mach. Learn"},{"issue":"1","key":"665_CR26","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/moor.2021.1147","volume":"47","author":"A Jalilzadeh","year":"2022","unstructured":"Jalilzadeh, A., Nedi\u0107, A., Shanbhag, U.V., Yousefian, F.: A variable sample-size stochastic quasi-Newton method for smooth and nonsmooth stochastic convex optimization. Math. Oper. Res. 47(1), 690\u2013719 (2022)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"665_CR27","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1137\/17M1152474","volume":"30","author":"F Yousefian","year":"2020","unstructured":"Yousefian, F., Nedic, A., Shanbhag, U.V.: On stochastic and deterministic quasi-Newton methods for nonstrongly convex optimization: asymptotic convergence and rate analysis. SIAM J. Optim. 30(2), 1144\u20131172 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"665_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-021-01629-y","volume":"194","author":"M Yang","year":"2022","unstructured":"Yang, M., Milzarek, A., Wen, Z., Zhang, T.: A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization. Math. Program. 194(1\u20132), 257\u2013303 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01629-y","journal-title":"Math. Program."},{"key":"665_CR29","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-981-15-1816-4_2","volume":"1098","author":"J Rafati","year":"2020","unstructured":"Rafati, J., Marica, R.F.: Quasi-Newton optimization methods for deep learning applications. Advi. Intell. Syst. Comput. 1098, 9\u201338 (2020)","journal-title":"Advi. Intell. Syst. Comput."},{"key":"665_CR30","unstructured":"Goldfarb, D., Ren, Y., Bahamou, A.: Practical quasi-Newton methods for training deep neural networks (2020)"},{"key":"665_CR31","unstructured":"Berahas, A.S., Nocedal, J., Tak\u00e1\u010d, M.: A multi-batch L-BFGS method for machine learning. Adv. Neural Inf. Process. Syst. , 1063\u20131071 (2016)"},{"key":"665_CR32","unstructured":"Bollapragada, R., Nocedal, J., Mudigere, D., Shi, H.-J., Tang, P.T.P.: A progressive batching L-BFGS method for machine learning. International Conference Machine Learning, 620\u2013629 (2018). PMLR"},{"key":"665_CR33","unstructured":"Gower, R., Goldfarb, D., Richt\u00e1rik, P.: Stochastic block BFGS: Squeezing more curvature out of data. In: International Conference on Machine Learning, 1869\u20131878 (2016). PMLR"},{"issue":"3","key":"665_CR34","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s10589-019-00127-4","volume":"74","author":"JJ Brust","year":"2019","unstructured":"Brust, J.J., Marcia, R.F., Petra, C.G.: Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints. Comput. Optim. Appl. 74(3), 669\u2013701 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"665_CR35","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1137\/21M1393819","volume":"44","author":"JJ Brust","year":"2022","unstructured":"Brust, J.J., Marcia, R.F., Petra, C.G., Saunders, M.A.: Large-scale optimization with linear equality constraints using reduced compact representation. SIAM J. Sci. Comput. 44(1), 103\u2013127 (2022)","journal-title":"SIAM J. Sci. Comput."},{"key":"665_CR36","unstructured":"Mathieu, M., LeCun, Y.: Fast approximation of rotations and hessians matrices. arXiv preprint arXiv:1404.7195 (2014)"},{"key":"665_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cag.2014.01.002","volume":"40","author":"Y Fei","year":"2014","unstructured":"Fei, Y., Rong, G., Wang, B., Wang, W.: Parallel L-BFGS-B algorithm on gpu. Comput. Graph. 40, 1\u20139 (2014)","journal-title":"Comput. Graph."},{"issue":"5","key":"665_CR38","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"665_CR39","unstructured":"Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in pytorch (2017)"},{"issue":"4","key":"665_CR40","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. (TOMS) 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"665_CR41","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"...Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, \u0130, Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P.: SciPy 10 contributors: SciPy 10: fundamental algorithms for scientific computing in Python. Nat. Methods 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat. Methods"},{"key":"665_CR42","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0024-3795(91)90009-L","volume":"143","author":"M Bierlaire","year":"1991","unstructured":"Bierlaire, M., Toint, P.L., Tuyttens, D.: On iterative algorithms for linear least squares problems with bound constraints. Linear Algebra Appl. 143, 111\u2013143 (1991)","journal-title":"Linear Algebra Appl."},{"key":"665_CR43","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Orban, D., Toint, P.L.: Cutest: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"78","key":"665_CR44","doi-asserted-by":"publisher","first-page":"4377","DOI":"10.21105\/joss.04377","volume":"7","author":"J Fowkes","year":"2022","unstructured":"Fowkes, J., Roberts, L.: B\u0171rmen: Pycutest: an open source python package of optimization test problems. J. Open Source Softw. 7(78), 4377 (2022). https:\/\/doi.org\/10.21105\/joss.04377","journal-title":"J. Open Source Softw."},{"key":"665_CR45","doi-asserted-by":"publisher","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. In: Kotz, S., Johnson, N.L. (eds.) Breakthroughs in Statistics: Methodology and Distribution, 196\u2013202. , New York, NY (1992). https:\/\/doi.org\/10.1007\/978-1-4612-4380-9_16","DOI":"10.1007\/978-1-4612-4380-9_16"},{"issue":"3","key":"665_CR46","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-7152(96)00140-X","volume":"33","author":"RK Pace","year":"1997","unstructured":"Pace, R.K., Barry, R.: Sparse spatial autoregressions. Stat. Prob. Lett. 33(3), 291\u2013297 (1997)","journal-title":"Stat. Prob. Lett."},{"key":"665_CR47","unstructured":"LeCun, Y., Cortes, C.: MNIST handwritten digit database (2010)"},{"key":"665_CR48","unstructured":"avieira: Python L-BFGS-B. https:\/\/github.com\/avieira\/python_lbfgsb"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00665-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00665-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00665-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:33:22Z","timestamp":1742960002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00665-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00665-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"31 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 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":"The authors declare no conflict of interest with respect to the research and publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}