{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T22:22:33Z","timestamp":1787782953640,"version":"build-2784847793"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s12532-026-00313-6","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:53:27Z","timestamp":1774335207000},"page":"877-948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Implementation of Third-order Tensor Methods with Adaptive Regularization for Unconstrained Optimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Coralia","family":"Cartis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raphael","family":"Hauser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Welzel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenqi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,24]]},"reference":[{"key":"313_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2024.109808","volume":"452","author":"AA Ahmadi","year":"2024","unstructured":"Ahmadi, A.A., Chaudhry, A., Zhang, J.: Higher-order Newton methods with polynomial work per iteration. Adv. Math. 452, 109808 (2024). https:\/\/doi.org\/10.1016\/j.aim.2024.109808","journal-title":"Adv. Math."},{"issue":"3","key":"313_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/02331930500100270","volume":"54","author":"M Andretta","year":"2005","unstructured":"Andretta, M., Birgin, E.G., Mart\u00ednez, J.M.: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization. Optimization 54(3), 305\u2013325 (2005). https:\/\/doi.org\/10.1080\/02331930500100270. (http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/02331930500100270)","journal-title":"Optimization"},{"key":"313_CR3","unstructured":"Beale, E.M.L.: On an iterative method of finding a local minimum of a function of more than one variable. Tech. Rep.\u00a025, Statistical Techniques Research Group, Princeton University, Princeton, N.J. (1958)"},{"issue":"4","key":"313_CR4","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11590-019-01395-z","volume":"14","author":"EG Birgin","year":"2020","unstructured":"Birgin, E.G., Gardenghi, J., Mart\u00ednez, J.M., Santos, S.A.: On the use of third-order models with fourth-order regularization for unconstrained optimization. Optim. Lett. 14(4), 815\u2013838 (2020). https:\/\/doi.org\/10.1007\/s11590-019-01395-z","journal-title":"Optim. Lett."},{"issue":"1","key":"313_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1065-8","journal-title":"Math. Program."},{"key":"313_CR6","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A.: Third-order derivatives of the mor\u00e9, garbow, and hillstrom test set problems. Tech. Rep. MCDO010418, Department of Computer Science, University of S\u00e3o Paulo, S\u00e3o Paulo, SP, Brazil (2018)"},{"key":"313_CR7","doi-asserted-by":"publisher","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A Box-Constrained Optimization Algorithm with Negative Curvature Directions and Spectral Projected Gradients. In: Alefeld, G., Chen, X., (eds.) Topics in Numerical Analysis, vol.\u00a015, pp. 49\u201360. Springer Vienna, Vienna (2001). https:\/\/doi.org\/10.1007\/978-3-7091-6217-0_5. http:\/\/link.springer.com\/10.1007\/978-3-7091-6217-0_5","DOI":"10.1007\/978-3-7091-6217-0_5"},{"issue":"1","key":"313_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23(1), 101\u2013125 (2002). https:\/\/doi.org\/10.1023\/A:1019928808826","journal-title":"Comput. Optim. Appl."},{"key":"313_CR9","unstructured":"Carmon, Y., Duchi, J.C.: Analysis of krylov subspace solutions of regularized non-convex quadratic problems. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R., (eds.) Advances in Neural Information Processing Systems, vol.\u00a031. Curran Associates, Inc. (2018). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2018\/file\/349f36aa789af083b8e26839bd498af9-Paper.pdf"},{"issue":"1","key":"313_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-019-01406-y","volume":"184","author":"Y Carmon","year":"2020","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points I. Math. Program. 184(1), 71\u2013120 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01406-y","journal-title":"Math. Program."},{"issue":"1","key":"313_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-019-01431-x","volume":"185","author":"Y Carmon","year":"2021","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points II: first-order methods. Math. Program. 185(1), 315\u2013355 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01431-x","journal-title":"Math. Program."},{"issue":"1","key":"313_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10543-008-0206-8","volume":"49","author":"C Cartis","year":"2009","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Trust-region and other regularisations of linear least-squares problems. BIT Numer. Math. 49(1), 21\u201353 (2009). https:\/\/doi.org\/10.1007\/s10543-008-0206-8","journal-title":"BIT Numer. Math."},{"issue":"2","key":"313_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/10556788.2019.1678033","volume":"35","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw 35(2), 243\u2013256 (2020). https:\/\/doi.org\/10.1080\/10556788.2019.1678033","journal-title":"Optim. Methods Softw"},{"issue":"1","key":"313_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/17M1144854","volume":"30","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. SIAM J. Optim. 30(1), 513\u2013541 (2020). https:\/\/doi.org\/10.1137\/17M1144854","journal-title":"SIAM J. Optim."},{"key":"313_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976991","author":"C Cartis","year":"2022","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Evaluation complexity of algorithms for nonconvex optimization. MOS-SIAM Ser. Optim (2022). https:\/\/doi.org\/10.1137\/1.9781611976991","journal-title":"MOS-SIAM Ser. Optim"},{"issue":"2","key":"313_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0286-5","journal-title":"motivation, convergence and numerical results. Math. Program."},{"issue":"2","key":"313_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization Part II: Math. Program. worst-case function- and derivative-evaluation complexity. 130(2), 295\u2013319 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0337-y","journal-title":"Math. Program. worst-case function- and derivative-evaluation complexity."},{"issue":"5","key":"313_CR18","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s10208-017-9363-y","volume":"18","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization. Found. Comput. Math. 18(5), 1073\u20131107 (2018). https:\/\/doi.org\/10.1007\/s10208-017-9363-y","journal-title":"Found. Comput. Math."},{"key":"313_CR19","doi-asserted-by":"publisher","unstructured":"Cartis, C., Zhu, W.: Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods. arXiv preprint arXiv:2308.15336 (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.15336","DOI":"10.48550\/arXiv.2308.15336"},{"key":"313_CR20","unstructured":"Chow, T.T.: Derivative and Secant Tensor Methods for Unconstrained Optimization. Ph.D. thesis, University of Colorado at Boulder (1989)"},{"issue":"1","key":"313_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-020-01606-x","volume":"193","author":"N Doikov","year":"2022","unstructured":"Doikov, N., Nesterov, Y.: Local convergence of tensor methods. Math. Program. 193(1), 315\u2013336 (2022). https:\/\/doi.org\/10.1007\/s10107-020-01606-x","journal-title":"Math. Program."},{"issue":"2","key":"313_CR22","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":"2","key":"313_CR23","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","volume":"33","author":"JP Dussault","year":"2018","unstructured":"Dussault, J.P.: ARCq: a new adaptive regularization by cubics. Optim. Methods Softw 33(2), 322\u2013335 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1322080","journal-title":"Optim. Methods Softw"},{"key":"313_CR24","doi-asserted-by":"publisher","unstructured":"Erdogdu, M.A., Montanari, A.: Convergence rates of sub-sampled newton methods. In: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 2, NIPS\u201915, p. 3052\u20133060. MIT Press, Cambridge, MA, USA (2015). https:\/\/doi.org\/10.5555\/2969442.2969580","DOI":"10.5555\/2969442.2969580"},{"issue":"2","key":"313_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw (TOMS) 43(2), 15 (2016). https:\/\/doi.org\/10.1145\/2950048","journal-title":"ACM Trans. Math. Softw (TOMS)"},{"key":"313_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-011-9446-7","volume":"53","author":"NI Gould","year":"2012","unstructured":"Gould, N.I., Porcelli, M., Toint, P.L.: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53, 1\u201322 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9446-7","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"313_CR27","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1093\/imanum\/drac005","volume":"43","author":"S Gratton","year":"2023","unstructured":"Gratton, S., Toint, P.L.: Adaptive regularization minimization algorithms with nonsmooth norms. IMA J. Numer. Anal. 43(2), 920\u2013949 (2023). https:\/\/doi.org\/10.1093\/imanum\/drac005","journal-title":"IMA J. Numer. Anal."},{"key":"313_CR28","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Tech. rep., Technical report NA\/12 (1981)"},{"issue":"1\u20134","key":"313_CR29","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6(1\u20134), 164\u2013189 (1927). https:\/\/doi.org\/10.1002\/sapm192761164","journal-title":"J. Math. Phys."},{"key":"313_CR30","unstructured":"Kohler, J.M., Lucchi, A.: Sub-sampled cubic regularization for non-convex optimization. In: Precup, D., Teh, Y.W., (eds.) Proceedings of the 34th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a070, pp. 1895\u20131904. PMLR (2017). https:\/\/proceedings.mlr.press\/v70\/kohler17a.html"},{"issue":"1","key":"313_CR31","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1137\/19M1302211","volume":"31","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Roosta, F.: Convergence of Newton-MR under inexact Hessian information. SIAM J. Optim. 31(1), 59\u201390 (2021). https:\/\/doi.org\/10.1137\/19M1302211","journal-title":"SIAM J. Optim."},{"key":"313_CR32","doi-asserted-by":"publisher","unstructured":"Liu, Y., Roosta, F.: A Newton-MR Algorithm With Complexity Guarantees for Nonconvex Smooth Unconstrained Optimization. arXiv preprint arXiv:2208.07095 (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.07095","DOI":"10.48550\/arXiv.2208.07095"},{"key":"313_CR33","doi-asserted-by":"publisher","unstructured":"Martens, J.: Deep learning via hessian-free optimization. In: Proceedings of the 27th International Conference on International Conference on Machine Learning, ICML\u201910, p. 735\u2013742. Omnipress, Madison, WI, USA (2010). https:\/\/doi.org\/10.5555\/3104322.3104416","DOI":"10.5555\/3104322.3104416"},{"key":"313_CR34","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Global Optim. 68, 367\u2013385 (2017). https:\/\/doi.org\/10.1007\/s10898-016-0475-8","journal-title":"J. Global Optim."},{"issue":"1","key":"313_CR35","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 (TOMS) 7(1), 17\u201341 (1981). https:\/\/doi.org\/10.1145\/355934.355936","journal-title":"ACM Trans. Math. Softw (TOMS)"},{"issue":"1","key":"313_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-019-01449-1","volume":"186","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Implementable tensor methods in unconstrained convex optimization. Math. Program. 186(1), 157\u2013183 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01449-1","journal-title":"Math. Program."},{"issue":"4","key":"313_CR37","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1137\/20M134705X","volume":"31","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Inexact high-order proximal-point methods with auxiliary search procedure. SIAM J. Optim. 31(4), 2807\u20132828 (2021). https:\/\/doi.org\/10.1137\/20M134705X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"313_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-021-01930-y","volume":"191","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Superfast second-order methods for unconstrained convex optimization. J. Optim. Theory Appl. 191(1), 1\u201330 (2021). https:\/\/doi.org\/10.1007\/s10957-021-01930-y","journal-title":"J. Optim. Theory Appl."},{"key":"313_CR39","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Quartic Regularity. arXiv preprint arXiv:2201.04852 (2022). https:\/\/doi.org\/10.48550\/arXiv.2201.04852","DOI":"10.48550\/arXiv.2201.04852"},{"issue":"1","key":"313_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-021-01727-x","volume":"197","author":"Y Nesterov","year":"2023","unstructured":"Nesterov, Y.: Inexact accelerated high-order proximal-point methods. Math. Program. 197(1), 1\u201326 (2023). https:\/\/doi.org\/10.1007\/s10107-021-01727-x","journal-title":"Math. Program."},{"issue":"1","key":"313_CR41","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(1), 177\u2013205 (2006). https:\/\/doi.org\/10.1007\/s10107-006-0706-8","journal-title":"Math. Program."},{"key":"313_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer (1999). https:\/\/doi.org\/10.1007\/b98874","journal-title":"Numerical optimization. Springer"},{"issue":"2","key":"313_CR43","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1093\/comjnl\/5.2.147","volume":"5","author":"MJD Powell","year":"1962","unstructured":"Powell, M.J.D.: An iterative method for finding stationary values of a function of several variables. Comput. J. 5(2), 147\u2013151 (1962). https:\/\/doi.org\/10.1093\/comjnl\/5.2.147","journal-title":"Comput. J."},{"issue":"3","key":"313_CR44","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1137\/0801020","volume":"1","author":"RB Schnabel","year":"1991","unstructured":"Schnabel, R.B., Chow, T.T.: Tensor methods for unconstrained optimization using second derivatives. SIAM J. Optim. 1(3), 293\u2013315 (1991). https:\/\/doi.org\/10.1137\/0801020","journal-title":"SIAM J. Optim."},{"issue":"5","key":"313_CR45","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1137\/0721054","volume":"21","author":"RB Schnabel","year":"1984","unstructured":"Schnabel, R.B., Frank, P.D.: Tensor methods for nonlinear equations. SIAM J. Numer. Anal. 21(5), 815\u2013843 (1984). https:\/\/doi.org\/10.1137\/0721054","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"313_CR46","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1137\/23M1549687","volume":"34","author":"K Welzel","year":"2024","unstructured":"Welzel, K., Hauser, R.A.: Approximating higher-order derivative tensors using secant updates. SIAM J. Optim. 34(1), 893\u2013917 (2024). https:\/\/doi.org\/10.1137\/23M1549687","journal-title":"SIAM J. Optim."},{"key":"313_CR47","doi-asserted-by":"publisher","unstructured":"Welzel, K., Liu, Y., Hauser, R.A., Cartis, C.: Local convergence of adaptively regularized tensor methods. arXiv preprint arXiv:2510.25643 (2025). https:\/\/doi.org\/10.48550\/arXiv.2510.25643","DOI":"10.48550\/arXiv.2510.25643"},{"key":"313_CR48","unstructured":"Zhu, W., Cartis, C.: Quartic Polynomial Sub-problem Solutions in Tensor Methods for Nonconvex Optimization. In: NeurIPS 2022 Workshop (2022). https:\/\/order-up-ml.github.io\/papers\/24.pdf"},{"key":"313_CR49","doi-asserted-by":"publisher","unstructured":"Zhu, W., Cartis, C.: Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. arXiv preprint arXiv:2312.10283 (2023). https:\/\/doi.org\/10.48550\/arXiv.2312.10283","DOI":"10.48550\/arXiv.2312.10283"},{"key":"313_CR50","doi-asserted-by":"publisher","unstructured":"Zhu, W., Cartis, C.: Global convergence of high-order regularization methods with sums-of-squares taylor models. arXiv preprint arXiv:2404.03035 (2024). https:\/\/doi.org\/10.48550\/arXiv.2404.03035","DOI":"10.48550\/arXiv.2404.03035"}],"updated-by":[{"DOI":"10.1007\/s12532-026-00319-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T00:00:00Z","timestamp":1778025600000}}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-026-00313-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-026-00313-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-026-00313-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T07:58:32Z","timestamp":1787039912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-026-00313-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,24]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1007\/s12532-026-00313-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,24]]},"assertion":[{"value":"28 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s12532-026-00319-0","URL":"https:\/\/doi.org\/10.1007\/s12532-026-00319-0","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}]}}