{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:07:55Z","timestamp":1778717275783,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T00:00:00Z","timestamp":1753488000000},"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":["Numer Algor"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11075-025-02182-x","type":"journal-article","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T06:54:18Z","timestamp":1753512858000},"page":"1433-1463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Legendre polynomial based approximation of the Hessian for quasi-Newton optimization"],"prefix":"10.1007","volume":"102","author":[{"given":"Stefan","family":"Panic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,26]]},"reference":[{"key":"2182_CR1","unstructured":"J. Nocedal and S. J. Wright: Numerical Optimization. Springer, 2nd ed., New York (2006)"},{"key":"2182_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"JE Dennis Jr","year":"1974","unstructured":"Dennis, J.E., Jr., Mor\u00e9, J.J.: A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput. 28, 549\u2013560 (1974)","journal-title":"Math. Comput."},{"issue":"1","key":"2182_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis Jr","year":"1977","unstructured":"Dennis, J.E., Jr., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19(1), 46\u201389 (1977)","journal-title":"SIAM Rev."},{"key":"2182_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J Nocedal","year":"1992","unstructured":"Nocedal, J.: Theory of algorithms for unconstrained optimization. Acta Numerica 1, 1\u201337 (1992)","journal-title":"Acta Numerica"},{"key":"2182_CR5","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis Jr","year":"1983","unstructured":"Dennis, J.E., Jr., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)"},{"key":"2182_CR6","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, New York (1987)","edition":"2"},{"key":"2182_CR7","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"key":"2182_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78723-7","volume-title":"Nonlinear Optimization with Engineering Applications","author":"M Bartholomew-Biggs","year":"2008","unstructured":"Bartholomew-Biggs, M.: Nonlinear Optimization with Engineering Applications. Springer, New York (2008)"},{"key":"2182_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58356-3","volume-title":"Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology","author":"N Andrei","year":"2017","unstructured":"Andrei, N.: Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology. Springer, New York (2017)"},{"issue":"2","key":"2182_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. The Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"The Comput. J."},{"issue":"16","key":"2182_CR11","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e9re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Revue Fran\u00e7aise d\u2019Informatique et de Recherche Op\u00e9rationnelle 3(16), 35\u201343 (1969)","journal-title":"Revue Fran\u00e7aise d\u2019Informatique et de Recherche Op\u00e9rationnelle"},{"issue":"4","key":"2182_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"2182_CR13","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. Num. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Num. Anal."},{"issue":"1","key":"2182_CR14","first-page":"1","volume":"12","author":"N Andrei","year":"2018","unstructured":"Andrei, N.: A new diagonal quasi-Newton method based on a weak secant equation and minimization of the trace. Opt. Lett. 12(1), 1\u201320 (2018)","journal-title":"Opt. Lett."},{"key":"2182_CR15","unstructured":"Ferreira, O.P., Oliveira, P.R.: An interpolation-based method for approximating the Hessian matrix in unconstrained optimization (2023). arXiv:2302.08580"},{"key":"2182_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1017\/S0004972718000552","volume":"98","author":"S Pani\u0107","year":"2018","unstructured":"Pani\u0107, S., Petrovi\u0107, M.J., Carevi\u0107, M.M.: Initial improvement of the hybrid accelerated gradient descent process. Bull. Aust. Math. Soc. 98, 331\u2013338 (2018)","journal-title":"Bull. Aust. Math. Soc."},{"key":"2182_CR17","first-page":"233","volume":"80","author":"M Petrovi\u0107","year":"2019","unstructured":"Petrovi\u0107, M., Rako\u010devi\u0107, V., Kontrec, N., Pani\u0107, S., Ili\u0107, D.: Hybridization of accelerated gradient descent method. Num. Algo. 80, 233\u2013253 (2019)","journal-title":"Num. Algo."},{"issue":"4","key":"2182_CR18","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s11075-009-9350-8","volume":"54","author":"PS Stanimirovi\u0107","year":"2010","unstructured":"Stanimirovi\u0107, P.S., Miladinovi\u0107, M.B.: Accelerated gradient descent methods with line search. Num. Alg. 54(4), 503\u2013520 (2010). https:\/\/doi.org\/10.1007\/s11075-009-9350-8","journal-title":"Num. Alg."},{"key":"2182_CR19","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$. Soviet Mathematics Doklady 27, 372\u2013376 (1983)","journal-title":"Soviet Mathematics Doklady"},{"key":"2182_CR20","doi-asserted-by":"crossref","unstructured":"P.S. Stanimirovi\u0107, G.V. Milovanovi\u0107, M.J. Petrovi\u0107, N.Z. Kontrec: A transformation of accelerated double step size method for unconstrained optimization. Mathematical Problems in Engineering, Article ID 283679, 8 pages (2015)","DOI":"10.1155\/2015\/283679"},{"key":"2182_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11075-019-00821-8","volume":"85","author":"MJ Petrovi\u0107","year":"2020","unstructured":"Petrovi\u0107, M.J., Rako\u010devi\u0107, V., Valjarevi\u0107, D., Ili\u0107, D.: A note on hybridization process applied on transformed double step size model. Num. Alg. 85, 117\u2013142 (2020)","journal-title":"Num. Alg."},{"issue":"3","key":"2182_CR22","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Opt. 15(3), 751\u2013779 (2005)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"2182_CR23","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Opt. 26(2), 1008\u20131031 (2016)","journal-title":"SIAM J. Opt."},{"key":"2182_CR24","unstructured":"Milovanovi\u0107, G.V.: Families of Euler\u2013Maclaurin formulae for composite Gauss\u2013Legendre and Lobatto quadratures. Bulletin T.CXLV de l\u2019Acad\u00e9mie serbe des sciences et des arts \u2014 Classe des Sciences math\u00e9matiques et naturelles, 38, 63\u201381 (2013)"},{"key":"2182_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68349-0","volume-title":"Interpolation Processes: Basic Theory and Applications","author":"G Mastroianni","year":"2008","unstructured":"Mastroianni, G., Milovanovi\u0107, G.V.: Interpolation Processes: Basic Theory and Applications. Springer Monographs in Mathematics. Springer, Berlin, Heidelberg (2008)"},{"key":"2182_CR26","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Applied Optimization, vol. 87 (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"2182_CR27","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Opt. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Opt."},{"key":"2182_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2013\/625953","volume":"2013","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimization problems. J. Model. Simul. Eng. 2013, 1\u201317 (2013). https:\/\/doi.org\/10.1155\/2013\/625953","journal-title":"J. Model. Simul. Eng."},{"key":"2182_CR29","unstructured":"Surjanovic, S., Bingham, D.: Virtual Library of Simulation Experiments: Test Functions and Datasets. Simon Fraser University. https:\/\/www.sfu.ca\/ ssurjano\/optimization.html"},{"key":"2182_CR30","volume-title":"Methods of Numerical Integration","author":"PJ Davis","year":"2007","unstructured":"Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration. Dover Publications, New York (2007)"},{"issue":"2","key":"2182_CR31","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. Prog. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Prog."},{"issue":"1","key":"2182_CR32","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Opt. 20(1), 172\u2013191 (2009). https:\/\/doi.org\/10.1137\/080724083","journal-title":"SIAM J. Opt."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02182-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02182-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02182-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:12:29Z","timestamp":1778713949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02182-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,26]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["2182"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02182-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,26]]},"assertion":[{"value":"29 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}