{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:55:00Z","timestamp":1740142500845,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["406269\/2016-5"],"award-info":[{"award-number":["406269\/2016-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s40314-021-01621-4","type":"journal-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T07:17:58Z","timestamp":1633591078000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-3371","authenticated-orcid":false,"given":"Geovani N.","family":"Grapiglia","sequence":"first","affiliation":[]},{"given":"Fl\u00e1via","family":"Chorobura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"1621_CR1","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10957-020-01666-1","volume":"185","author":"EH Bergou","year":"2020","unstructured":"Bergou EH, Diouane Y, Kungurtsev V (2020) Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems. J Optim Theory Appl 185:927\u2013944","journal-title":"J Optim Theory Appl"},{"key":"1621_CR2","unstructured":"Birgin EG, Mart\u00ednez JM (2020) Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. arXiv: 2012.13251 [math.NA]"},{"key":"1621_CR3","unstructured":"Birgin EG, Gardenghi JL, Marcondes DS, Mart\u00ednez JM (2021) Accelerated derivative-free spectral residual method for nonlinear systems of equations. arXiv: 2104.13447 [math.NA]"},{"key":"1621_CR4","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis C, Gould NIM, Toint PhL (2011) On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J Optim 21:1721\u20131739","journal-title":"SIAM J Optim"},{"key":"1621_CR5","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1093\/imanum\/drn019","volume":"29","author":"W Cheng","year":"2009","unstructured":"Cheng W, Li D-H (2009) A derivative-free nonmonotone line search and its application to the spectral residual method. IMA J Numer Anal 29:814\u2013825","journal-title":"IMA J Numer Anal"},{"key":"1621_CR6","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani R, J\u00fadice D, Vicente LN (2016) Trust-region methods without derivatives: Wosrt case complexity and the nonsmooth case. SIAM J Optim 26:1987\u20132011","journal-title":"SIAM J Optim"},{"key":"1621_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF00249054","volume":"5","author":"C Geiger","year":"1996","unstructured":"Geiger C, Kanzow C (1996) On the resolution of monotone complementarity problems. Comput Optim Appl 5:155\u2013173","journal-title":"Comput Optim Appl"},{"key":"1621_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-6080(88)90023-8","volume":"1","author":"RP Gorman","year":"1988","unstructured":"Gorman RP, Sejnowski TJ (1988) Analysis of hidden units in a layered network trained to classify sonar targets. Neural Netw 1:75\u201389","journal-title":"Neural Netw"},{"key":"1621_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-017-9928-3","volume":"68","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia GN, Sachs EW (2017) On the worst-case evaluation complexity of non-monotone line search algorithms. Comput Optim Appl 68:555\u2013577","journal-title":"Comput Optim Appl"},{"key":"1621_CR10","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s40314-014-0201-4","volume":"35","author":"GN Grapiglia","year":"2016","unstructured":"Grapiglia GN, Yuan J, Yuan Y (2016) A derivative-free trust-region algorithm for composite nonsmooth optimization. Comput Appl Math 35:475\u2013499","journal-title":"Comput Appl Math"},{"key":"1621_CR11","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23:707\u2013716","journal-title":"SIAM J Numer Anal"},{"key":"1621_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s40305-017-0184-0","volume":"6","author":"J-C Huang","year":"2018","unstructured":"Huang J-C, Fan J-Y (2018) Global Complexity Bound of the Inexact Levenberg-Marquardt Method. J Oper Res Soc China 6:417\u2013428","journal-title":"J Oper Res Soc China"},{"key":"1621_CR13","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10589-016-9845-x","volume":"65","author":"EW Karas","year":"2016","unstructured":"Karas EW, Santos SA, Svaiter BF (2016) Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method. Comput Optim Appl 65:723\u2013751","journal-title":"Comput Optim Appl"},{"key":"1621_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.jcp.2003.08.010","volume":"193","author":"DA Knoll","year":"2004","unstructured":"Knoll DA, Keyes DE (2004) Jacobian-free Newton-Krylov methods: a survey of approaches and applications. J Comput Phys 193:357\u2013397","journal-title":"J Comput Phys"},{"key":"1621_CR15","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1080\/10556780310001610493","volume":"18","author":"W La Cruz","year":"2003","unstructured":"La Cruz W, Raydan M (2003) Nonmonotone spectral methods for large-scale nonlinear systems. Optim Methods Softw 18:583\u2013599","journal-title":"Optim Methods Softw"},{"key":"1621_CR16","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1090\/S0025-5718-06-01840-0","volume":"75","author":"W La Cruz","year":"2006","unstructured":"La Cruz W, Mart\u00ednez JM, Raydan M (2006) Spectral residual method without gradient information for solving large-scale nonlinear systems of equations. Math Comput 75:1429\u20131448","journal-title":"Math Comput"},{"key":"1621_CR17","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s11075-017-0299-8","volume":"76","author":"W La Cruz","year":"2017","unstructured":"La Cruz W (2017) A spectral algorithm for large-scale systems of nonlinear monotone equations. Numer Algorithms 76:1109\u20131130","journal-title":"Numer Algorithms"},{"key":"1621_CR18","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.jcp.2013.09.026","volume":"257","author":"M Losh","year":"2014","unstructured":"Losh M, Fuchs A, Lemieux J-F, Vanselow A (2014) A parallel Jacobian-free Newton-Krylov solver for a coupled sea ice-ocean model. J Comput Phys 257:901\u2013911","journal-title":"J Comput Phys"},{"key":"1621_CR19","doi-asserted-by":"publisher","first-page":"046705046705","DOI":"10.1103\/PhysRevE.85.046705","volume":"85","author":"O Lovsletten","year":"2012","unstructured":"Lovsletten O, Rypdal M (2012) Approximated maximum likelihood estimation in multifractal random walks. Phys Rev E 85:046705046705","journal-title":"Phys Rev E"},{"key":"1621_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1111\/1756-2171.12049","volume":"45","author":"NH Miller","year":"2014","unstructured":"Miller NH, Osborne M (2014) Spatial differentiation and price discrimination in the cement industry: evidence from a structural model. Rand J Econ 45:221\u2013247","journal-title":"Rand J Econ"},{"key":"1621_CR21","doi-asserted-by":"publisher","first-page":"6619","DOI":"10.1007\/s40314-018-0696-1","volume":"37","author":"H Mohammad","year":"2018","unstructured":"Mohammad H, Santos SA (2018) A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares. Comput Appl Math 37:6619\u20136653","journal-title":"Comput Appl Math"},{"key":"1621_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9 JJ, Garbow BS, Hillstrom KE (1981) Testing unconstrained optimization software. ACM Trans Math Softw 7:17\u201341","journal-title":"ACM Trans Math Softw"},{"key":"1621_CR23","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9 JJ, Wild SM (2009) Benchmarking derivative-Free optimization algorithms. SIAM J Optim 20:172\u2013191","journal-title":"SIAM J Optim"},{"key":"1621_CR24","volume-title":"Iterative solution of nonlinear equations in several variables","author":"JM Ortega","year":"1970","unstructured":"Ortega JM, Rheinboldt WC (1970) Iterative solution of nonlinear equations in several variables. Academic Press, New York"},{"key":"1621_CR25","first-page":"1059","volume":"40","author":"EW Sachs","year":"2011","unstructured":"Sachs EW, Sachs SM (2011) Nonmonotone line searches for optimization algorithms. Control Cybern 40:1059\u20131075","journal-title":"Control Cybern"},{"key":"1621_CR26","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10957-010-9731-0","volume":"147","author":"K Ueda","year":"2010","unstructured":"Ueda K, Yamashita N (2010) On a global complexity bound of the Levenberg-Marquardt method. J Optim Theory Appl 147:443\u2013453","journal-title":"J Optim Theory Appl"},{"key":"1621_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v032.i04","volume":"32","author":"R Varadhan","year":"2009","unstructured":"Varadhan R, Gilbert PD (2009) BB: an R package for solving a large system of nonlinear equations and for optimizing a high-dimensional nonlinear objective function. J Stat Softw 32:1\u201326","journal-title":"J Stat Softw"},{"key":"1621_CR28","doi-asserted-by":"publisher","first-page":"A153","DOI":"10.1051\/0004-6361\/201527339","volume":"586","author":"M Viallet","year":"2016","unstructured":"Viallet M, Goffrey T, Baraffe I, Folini D, Geroux C, Popov MV, Pratt J, Wolder R (2016) A Jacobian-free Newton-Krylov method for time-implicit multidimensional hydrodynamics. Astron Astrophys 586:A153","journal-title":"Astron Astrophys"},{"key":"1621_CR29","doi-asserted-by":"publisher","first-page":"108741","DOI":"10.1016\/j.jcp.2019.06.018","volume":"397","author":"A Yildirim","year":"2019","unstructured":"Yildirim A, Kenway GKW, Mader CA, Martins JRRA (2019) A Jacobian-free approximate Newton-Krylov startup strategy for RANS simulations. J Comput Phys 397:108741","journal-title":"J Comput Phys"},{"key":"1621_CR30","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"HC Zhang","year":"2004","unstructured":"Zhang HC, Hager WW (2004) A nonmonotone line search technique for unconstrained optimization. SIAM J Optim 14:1043\u20131056","journal-title":"SIAM J Optim"},{"key":"1621_CR31","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/10556788.2016.1179737","volume":"31","author":"R Zhao","year":"2016","unstructured":"Zhao R, Fan J (2016) Global complexity bound of the Levenberg-Marquardt method. Optim Methods Softw 31:805\u2013814","journal-title":"Optim Methods Softw"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01621-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01621-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01621-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T13:12:32Z","timestamp":1638537152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01621-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,7]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1621"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01621-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,10,7]]},"assertion":[{"value":"12 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"259"}}