{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:04:43Z","timestamp":1776830683272,"version":"3.51.2"},"reference-count":45,"publisher":"American Mathematical Society (AMS)","issue":"321","license":[{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475- 7"],"award-info":[{"award-number":["2013\/05475- 7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["and 2018\/24293-0"],"award-info":[{"award-number":["and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2014\/18711-3"],"award-info":[{"award-number":["2014\/18711-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["2013\/05475- 7"],"award-info":[{"award-number":["2013\/05475- 7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["and 2018\/24293-0"],"award-info":[{"award-number":["and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["2014\/18711-3"],"award-info":[{"award-number":["2014\/18711-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00c3\u00adfico e Tecnol\u00c3\u00b3gico","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["2013\/05475- 7"],"award-info":[{"award-number":["2013\/05475- 7"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["and 2018\/24293-0"],"award-info":[{"award-number":["and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["2014\/18711-3"],"award-info":[{"award-number":["2014\/18711-3"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u00c5\u00a1kog Razvoja","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475- 7"],"award-info":[{"award-number":["2013\/05475- 7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["and 2018\/24293-0"],"award-info":[{"award-number":["and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2014\/18711-3"],"award-info":[{"award-number":["2014\/18711-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00c3\u00a7\u00c3\u00a3o de Amparo \u00c3 Pesquisa do Estado de S\u00c3\u00a3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>In many cases in which one wishes to minimize a complicated or expensive function, it is convenient to employ cheap approximations, at least when the current approximation to the solution is poor. Adequate strategies for deciding the accuracy desired at each stage of optimization are crucial for the global convergence and overall efficiency of the process. A recently introduced procedure [E. G. Birgin, N. Kreji\u0107, and J. M. Mart\u00ednez, Math. Comp. 87 (2018), 1307\u20131326, 2018] based on Inexact Restoration is revisited, modified, and analyzed from the point of view of worst-case evaluation complexity in this work.<\/p>","DOI":"10.1090\/mcom\/3445","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:54:20Z","timestamp":1553154860000},"page":"253-278","source":"Crossref","is-referenced-by-count":14,"title":["Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact"],"prefix":"10.1090","volume":"89","author":[{"given":"E.","family":"Birgin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Kreji\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2019,4,25]]},"reference":[{"issue":"3","key":"1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-007-9147-4","article-title":"An inexact-restoration method for nonlinear bilevel programming problems","volume":"43","author":"Andreani, R.","year":"2009","journal-title":"Comput. Optim. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0926-6003","issn-type":"print"},{"key":"2","doi-asserted-by":"crossref","unstructured":"A. Asimakopulos, Keynes\u2019s General Theory and Accumulation, Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511522079"},{"issue":"3","key":"3","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s10957-012-0140-4","article-title":"Inexact restoration for Euler discretization of box-constrained optimal control problems","volume":"156","author":"Banihashemi, Nahid","year":"2013","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"key":"4","series-title":"Princeton Series in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"Ben-Tal, Aharon","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9780691143682"},{"key":"5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2014.12.031","article-title":"Assessing the reliability of general-purpose inexact restoration methods","volume":"282","author":"Birgin, E. G.","year":"2015","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"key":"6","unstructured":"E. G. Birgin, J. L. Gardenghi, J. M. Mart\u00ednez, and S. A. Santos, On the use of third-order models with fourth-order regularization for unconstrained optimization, Optimization Letters, to appear (DOI: 10.1007\/s11590-019-01395-z)."},{"issue":"1-2","key":"7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","article-title":"Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models","volume":"163","author":"Birgin, E. G.","year":"2017","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"2","key":"8","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/15M1031631","article-title":"Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models","volume":"26","author":"Birgin, E. G.","year":"2016","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"2","key":"9","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/16M110280X","article-title":"The use of quadratic regularization with a cubic descent condition for unconstrained optimization","volume":"27","author":"Birgin, E. G.","year":"2017","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"2","key":"10","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1137\/17M1127107","article-title":"On regularization and active-set methods with complexity for constrained optimization","volume":"28","author":"Birgin, E. G.","year":"2018","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"11","unstructured":"E. G. Birgin and J. M. Mart\u00ednez, A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization, Comput. Optim. Appl., to appear. DOI 10.1007\/s10589-019-00089-7."},{"issue":"4","key":"12","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","article-title":"Nonmonotone spectral projected gradient methods on convex sets","volume":"10","author":"Birgin, Ernesto G.","year":"2000","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"13","doi-asserted-by":"crossref","unstructured":"E. G. Birgin, J. M. Mart\u00ednez, and M. Raydan, Spectral projected gradient methods: Review and perspectives, J. Statistical Software 60 (2014), no 3. DOI 10.18637\/jss.v060.i03.","DOI":"10.18637\/jss.v060.i03"},{"issue":"311","key":"14","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1090\/mcom\/3246","article-title":"On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors","volume":"87","author":"Birgin, E. G.","year":"2018","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"2","key":"15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10957-005-6537-6","article-title":"Local convergence of an inexact-restoration method and numerical experiments","volume":"127","author":"Birgin, E. G.","year":"2005","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"issue":"2","key":"16","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/110856253","article-title":"Inexact restoration method for derivative-free optimization with smooth constraints","volume":"23","author":"Bueno, L. F.","year":"2013","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"6","key":"17","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","article-title":"On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization problems","volume":"20","author":"Cartis, C.","year":"2010","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results","volume":"127","author":"Cartis, Coralia","year":"2011","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"2","key":"19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity","volume":"130","author":"Cartis, Coralia","year":"2011","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"1","key":"20","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/16M1106316","article-title":"Universal regularization methods: varying the power, the smoothness and the accuracy","volume":"29","author":"Cartis, Coralia","year":"2019","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"21","doi-asserted-by":"crossref","unstructured":"B. H. Cervelin, D. Conti, M. A. Diniz-Ehrhardt, and J. M. Mart\u00ednez, A computer model for particle-like simulation in broiler houses, Computers and Electronics in Agriculture 141 (2017), 1\u201314. DOI 10.1016\/j.compag.2017.07.002.","DOI":"10.1016\/j.compag.2017.07.002"},{"issue":"1-2","key":"22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","article-title":"A trust region algorithm with a worst-case iteration complexity of \ud835\udcaa(\ud835\udf00^{-3\/2}) for nonconvex optimization","volume":"162","author":"Curtis, Frank E.","year":"2017","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"23","series-title":"Nonconvex Optimization and its Applications","isbn-type":"print","volume-title":"Foundations of bilevel programming","volume":"61","author":"Dempe, Stephan","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/1402006314"},{"issue":"2","key":"24","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","article-title":"\ud835\udc34\ud835\udc45\ud835\udc36_{\ud835\udc5e}: a new adaptive regularization by cubics","volume":"33","author":"Dussault, Jean-Pierre","year":"2018","journal-title":"Optim. Methods Softw.","ISSN":"https:\/\/id.crossref.org\/issn\/1055-6788","issn-type":"print"},{"key":"25","unstructured":"Y. Ermoliev, Stochastic Programming Methods, Academy of Sciences of the USSR, Kiev, 1967."},{"issue":"2","key":"26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10589-009-9267-0","article-title":"A new line search inexact restoration approach for nonlinear programming","volume":"46","author":"Fischer, Andreas","year":"2010","journal-title":"Comput. Optim. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0926-6003","issn-type":"print"},{"issue":"3","key":"27","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/S1052623401399320","article-title":"A globally convergent filter method for nonlinear programming","volume":"14","author":"Gonzaga, Cl\u00f3vis C.","year":"2003","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"28","unstructured":"G. N. Grapiglia and Yu. Nesterov, Globally convergent second-order schemes for minimizing twice differentiable functions, CORE Discussion Paper 2016\/28, Universit\u00e9 Catholique de Louvain, Louvain, Belgium, 2016."},{"issue":"1-2","key":"29","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","article-title":"On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization","volume":"152","author":"Grapiglia, Geovani N.","year":"2015","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"30","unstructured":"A. Griewank, The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms, Technical Report NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, 1981."},{"key":"31","unstructured":"A. O. Herrera, H. D. Scolnik, G. Chichilnisky, G. C. Gallopin, J. E. Hardoy, Catastrophe or New Society? A Latin America World Model, IDRC, Ottawa, ON, CA, 1976."},{"issue":"2","key":"32","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10957-007-9217-x","article-title":"Euler discretization and inexact restoration for optimal control","volume":"134","author":"Kaya, C. Y.","year":"2007","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"issue":"300","key":"33","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1090\/mcom\/3025","article-title":"Inexact restoration approach for minimization with inexact evaluation of the objective function","volume":"85","author":"Kreji\u0107, Nata\u0161a","year":"2016","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"34","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical programs with equilibrium constraints","author":"Luo, Zhi-Quan","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/0521572908"},{"issue":"1","key":"35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/0804009","article-title":"Local minimizers of quadratic functions on Euclidean balls and spheres","volume":"4","author":"Mart\u00ednez, Jos\u00e9 Mario","year":"1994","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1","key":"36","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1017567113614","article-title":"Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming","volume":"111","author":"Martinez, J. M.","year":"2001","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"issue":"4","key":"37","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1137\/17M1115472","article-title":"On high-order model regularization for constrained optimization","volume":"27","author":"Mart\u00ednez, Jos\u00e9 Mario","year":"2017","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1","key":"38","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1004632923654","article-title":"Inexact-restoration algorithm for constrained optimization","volume":"104","author":"Mart\u00ednez, J. M.","year":"2000","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"issue":"2","key":"39","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","article-title":"Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization","volume":"68","author":"Mart\u00ednez, J. M.","year":"2017","journal-title":"J. Global Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/0925-5001","issn-type":"print"},{"issue":"1","key":"40","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","article-title":"Cubic regularization of Newton method and its global performance","volume":"108","author":"Nesterov, Yurii","year":"2006","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"41","doi-asserted-by":"crossref","unstructured":"R. Pasupathy, On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization, Oper. Res. 58 (2010), 889\u2013901. DOI 10.1287\/opre.1090.0773.","DOI":"10.1287\/opre.1090.0773"},{"issue":"2","key":"42","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cam.2007.02.014","article-title":"Efficient sample sizes in stochastic nonlinear programming","volume":"217","author":"Polak, E.","year":"2008","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"issue":"1-2","key":"43","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-011-0453-3","article-title":"Optimality functions in stochastic programming","volume":"135","author":"Royset, J. O.","year":"2012","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"44","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1287\/opre.2013.1163","article-title":"Optimal budget allocation for sample average approximation","volume":"61","author":"Royset, Johannes O.","year":"2013","journal-title":"Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"45","series-title":"Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics","isbn-type":"print","volume-title":"Discrete event systems","author":"Rubinstein, Reuven Y.","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/0471934194"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-321\/S0025-5718-2019-03445-2\/mcom3445_AM.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/www.ams.org\/mcom\/2020-89-321\/S0025-5718-2019-03445-2\/S0025-5718-2019-03445-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-321\/S0025-5718-2019-03445-2\/S0025-5718-2019-03445-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:28:58Z","timestamp":1776828538000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-321\/S0025-5718-2019-03445-2\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,25]]},"references-count":45,"journal-issue":{"issue":"321","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["S0025-5718-2019-03445-2"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3445","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2019,4,25]]}}}