{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T19:39:48Z","timestamp":1775936388386,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971309"],"award-info":[{"award-number":["11971309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10589-022-00393-9","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T20:02:28Z","timestamp":1659124948000},"page":"381-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Levenberg\u2013Marquardt method based on probabilistic Jacobian models for nonlinear equations"],"prefix":"10.1007","volume":"83","author":[{"given":"Ruixue","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"issue":"3","key":"393_CR1","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Banderia","year":"2014","unstructured":"Banderia, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM J. Optim. 24(3), 1238\u20131264 (2014)","journal-title":"SIAM J. Optim."},{"key":"393_CR2","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1137\/140974687","volume":"4","author":"E Bergou","year":"2016","unstructured":"Bergou, E., Gratton, S., Vicente, L.N.: Levenberg\u2013Marquardt methods based on probabilistic gradient models and inexact subproblem solution, with application to data assimilation. SIAM\/ASA J. Uncertain. Quantif. 4, 924\u2013951 (2016)","journal-title":"SIAM\/ASA J. Uncertain. Quantif."},{"key":"393_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1137\/100814688","volume":"23","author":"SC Billups","year":"2013","unstructured":"Billups, S.C., Larson, J., Graf, P.: Derivative-free optimization of expensive functions with computational error using weighted regression. SIAM J. Optim. 23, 27\u201353 (2013)","journal-title":"SIAM J. Optim."},{"key":"393_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/040616413","volume":"27","author":"Z Chen","year":"2005","unstructured":"Chen, Z., Dongarra, J.J.: Condition numbers of Gaussian random matrixes. SIAM J. Matrix Anal. Appl. 27, 603\u2013620 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"393_CR5","first-page":"83","volume-title":"On the convergence of derivative-free methods for unconstrained optimization,","author":"A. R Conn","year":"1997","unstructured":"Conn, A.. R., Scheinberg, K., Toint, Ph.. L.: Approximation Theory and Optimization. In: Powell, M.. J.. D., Buhmann, M.. D., Iserles, A. (eds.) On the convergence of derivative-free methods for unconstrained optimization, pp. 83\u2013108. Cambridge University Press, Cambridge (1997)"},{"key":"393_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","volume":"111","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of interpolation sets in derivative free optimization. Math. Program. 111, 141\u2013172 (2008)","journal-title":"Math. Program."},{"key":"393_CR7","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)","DOI":"10.1137\/1.9780898718768"},{"key":"393_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1090\/S0025-5718-2011-02496-8","volume":"81","author":"JY Fan","year":"2012","unstructured":"Fan, J.Y.: The modified Levenberg\u2013Marquardt method for nonlinear equations with cubic convergence. Math. Comp. 81, 447\u2013466 (2012)","journal-title":"Math. Comp."},{"key":"393_CR9","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10915-018-0777-8","volume":"78","author":"JY Fan","year":"2019","unstructured":"Fan, J.Y., Huang, J.C., Pan, J.Y.: An adaptive multi-step Levenberg\u2013Marquardt method. J. Sci. Comput. 78, 531\u2013548 (2019)","journal-title":"J. Sci. Comput."},{"key":"393_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00607-004-0083-1","volume":"74","author":"JY Fan","year":"2005","unstructured":"Fan, J.Y., Yuan, Y.X.: On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption. Computing 74, 23\u201339 (2005)","journal-title":"Computing"},{"key":"393_CR11","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23, 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"393_CR12","first-page":"164","volume":"2","author":"K Levenberg","year":"1994","unstructured":"Levenberg, K.: A method for the solution of certain nonlinear problems in least squares. Quardt. Appl. Math. 2, 164\u2013166 (1994)","journal-title":"Quardt. Appl. Math."},{"key":"393_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"DW Marquardt","year":"1963","unstructured":"Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear inequalities. SIAM J. Appl. Math. 11, 431\u2013441 (1963)","journal-title":"SIAM J. Appl. Math."},{"key":"393_CR14","first-page":"246","volume":"26","author":"J Matyas","year":"1965","unstructured":"Matyas, J.: Random optimization. Autom. Remote Control 26, 246\u2013253 (1965)","journal-title":"Autom. Remote Control"},{"key":"393_CR15","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.H.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"393_CR16","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. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"393_CR17","unstructured":"Nesterov, Y.: Random gradient-free minimization of convex functions. Technical Report 2011\/1, J. Optim 22, 341\u2013362 (2012)"},{"key":"393_CR18","unstructured":"Polyak. B. T.: Introduction to Optimization, Optimization Software, (1987)"},{"key":"393_CR19","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)"},{"key":"393_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s10107-003-0430-6","volume":"97","author":"M. J. D Powell","year":"2003","unstructured":"Powell, M.. J.. D.: On trust region methods for unconstrained minimization without derivatives. Math. Program. Ser. B 97, 605\u2013623 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"393_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithm. SIAM J. Optim. 7, 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"393_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. Optim. 1, 143\u2013153 (2013)","journal-title":"EURO J. Comput. Optim."},{"key":"393_CR23","first-page":"237","volume":"15","author":"N Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg\u2013Marquardt method. Computing 15, 237\u2013249 (2001)","journal-title":"Computing"},{"key":"393_CR24","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1007\/s10915-017-0488-6","volume":"74","author":"RX Zhao","year":"2018","unstructured":"Zhao, R.X., Fan, J.Y.: On a new updating rule of the Levenberg\u2013Marquardt parameter. J. Sci. Comput. 74, 1146\u20131162 (2018)","journal-title":"J. Sci. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00393-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00393-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00393-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T12:18:41Z","timestamp":1664453921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00393-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,29]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00393-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,29]]},"assertion":[{"value":"28 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","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 declared that they have no conflicts of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}