{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:36:11Z","timestamp":1783578971624,"version":"3.55.0"},"reference-count":31,"publisher":"American Mathematical Society (AMS)","issue":"300","license":[{"start":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T00:00:00Z","timestamp":1473379200000},"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","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>A new method is introduced for minimizing a function that can be computed only inexactly, with different levels of accuracy. The challenge is to evaluate the (potentially very expensive) objective function with low accuracy as far as this does not interfere with the goal of getting high accuracy minimization at the end. For achieving this goal the problem is reformulated in terms of constrained optimization and handled with an Inexact Restoration technique. Convergence is proved and numerical experiments motivated by Electronic Structure Calculations are presented, which indicate that the new method overcomes current approaches for solving large-scale problems.<\/p>","DOI":"10.1090\/mcom\/3025","type":"journal-article","created":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T10:59:53Z","timestamp":1441796393000},"page":"1775-1791","source":"Crossref","is-referenced-by-count":21,"title":["Inexact Restoration approach for minimization with inexact evaluation of the objective function"],"prefix":"10.1090","volume":"85","author":[{"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"14","published-online":{"date-parts":[[2015,9,9]]},"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"},{"issue":"3","key":"2","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":"3","unstructured":"F. Bastin, Trust-Region Algorithms for Nonlinear Stochastic Programming and Mixed Logit Models,  PhD thesis, University of Namur, Belgium, (2004)."},{"issue":"1","key":"4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10287-005-0044-y","article-title":"An adaptive Monte Carlo algorithm for computing mixed logit estimators","volume":"3","author":"Bastin, Fabian","year":"2006","journal-title":"Comput. Manag. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1619-697X","issn-type":"print"},{"key":"5","doi-asserted-by":"crossref","unstructured":"E. G. Birgin, J. M. Mart\u00ednez, L. Mart\u00ednez, and G. B. Rocha, Sparse projected-gradient method as a linear-scaling low-memory alternative to diagonalization in self-consistent field electronic structure calculations, Journal of Chemical Theory and Computation 9 (2013), 1043-1051.","DOI":"10.1021\/ct3009683"},{"issue":"2","key":"6","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"},{"key":"7","series-title":"MPS\/SIAM Series on Optimization","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-region methods","author":"Conn, Andrew R.","year":"2000","ISBN":"https:\/\/id.crossref.org\/isbn\/0898714605"},{"issue":"2","key":"8","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":"9","doi-asserted-by":"publisher","first-page":"A1380--A1405","DOI":"10.1137\/110830629","article-title":"Hybrid deterministic-stochastic methods for data fitting","volume":"34","author":"Friedlander, Michael P.","year":"2012","journal-title":"SIAM J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1064-8275","issn-type":"print"},{"key":"10","series-title":"Johns Hopkins Studies in the Mathematical Sciences","isbn-type":"print","volume-title":"Matrix computations","author":"Golub, Gene H.","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/080185413X","edition":"3"},{"issue":"3","key":"11","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1137\/070707828","article-title":"Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints","volume":"31","author":"Gomes-Ruggiero, M. A.","year":"2009","journal-title":"SIAM J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1064-8275","issn-type":"print"},{"issue":"3","key":"12","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":"13","doi-asserted-by":"crossref","unstructured":"T. Helgaker, P. Jorgensen, and J. Olsen, Molecular Electronic-Structure Theory, John Wiley & Sons, New York, 2000, 433-502.","DOI":"10.1002\/9781119019572.ch10"},{"key":"14","doi-asserted-by":"crossref","unstructured":"T. Homem-de-Mello, Variable-sample methods for stochastic optimization,  ACM Transactions on Modeling and Computer Simulation 13 (2003), 108-133.","DOI":"10.1145\/858481.858483"},{"issue":"8","key":"15","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1080\/02331930903085342","article-title":"Local convergence of filter methods for equality constrained non-linear programming","volume":"59","author":"Karas, Elizabeth W.","year":"2010","journal-title":"Optimization","ISSN":"https:\/\/id.crossref.org\/issn\/0233-1934","issn-type":"print"},{"issue":"3","key":"16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10589-007-9162-5","article-title":"Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems","volume":"44","author":"Karas, Elizabeth W.","year":"2009","journal-title":"Comput. Optim. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0926-6003","issn-type":"print"},{"issue":"4","key":"17","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1137\/090766668","article-title":"Inexact restoration for Runge-Kutta discretization of optimal control problems","volume":"48","author":"Kaya, C. Yal\u00e7in","year":"2010","journal-title":"SIAM J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-1429","issn-type":"print"},{"issue":"2","key":"18","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"},{"key":"19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cam.2012.12.020","article-title":"Line search methods with variable sample size for unconstrained optimization","volume":"245","author":"Kreji\u0107, Nata\u0161a","year":"2013","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"issue":"4","key":"20","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s11075-014-9869-1","article-title":"Nonmonotone line search methods with variable sample size","volume":"68","author":"Kreji\u0107, Nata\u0161a","year":"2015","journal-title":"Numer. Algorithms","ISSN":"https:\/\/id.crossref.org\/issn\/1017-1398","issn-type":"print"},{"key":"21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S096249290400025X","article-title":"Computational chemistry from the perspective of numerical analysis","volume":"14","author":"Le Bris, Claude","year":"2005","journal-title":"Acta Numer.","ISSN":"https:\/\/id.crossref.org\/issn\/0962-4929","issn-type":"print"},{"issue":"1","key":"22","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":"1","key":"23","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"},{"key":"24","doi-asserted-by":"crossref","unstructured":"R. Pasupathy, On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization,  Operations Research 58 (2010), 889-901.","DOI":"10.1287\/opre.1090.0773"},{"issue":"2","key":"25","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":"26","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"},{"key":"27","series-title":"MPS\/SIAM Series on Optimization","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming","volume":"9","author":"Shapiro, Alexander","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9780898716870"},{"key":"28","series-title":"Handbooks in Operations Research and Management Science","isbn-type":"print","volume-title":"Stochastic programming","volume":"10","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/0444508546"},{"issue":"3","key":"29","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1287\/moor.21.3.615","article-title":"Convergence analysis of stochastic algorithms","volume":"21","author":"Shapiro, A.","year":"1996","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"key":"30","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138","volume-title":"Introduction to stochastic search and optimization","author":"Spall, James C.","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/0471330523"},{"issue":"2","key":"31","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00939456","article-title":"Stochastic algorithms with Armijo stepsizes for minimization of functions","volume":"64","author":"Wardi, Y.","year":"1990","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2016-85-300\/S0025-5718-2015-03025-7\/S0025-5718-2015-03025-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-300\/S0025-5718-2015-03025-7\/S0025-5718-2015-03025-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:49:32Z","timestamp":1776797372000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-300\/S0025-5718-2015-03025-7\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,9]]},"references-count":31,"journal-issue":{"issue":"300","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["S0025-5718-2015-03025-7"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3025","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":[[2015,9,9]]}}}