{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T19:40:19Z","timestamp":1719344419724},"reference-count":24,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,7,23]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Based on a modified secant equation, we propose a scalar approximation of the Hessian to be used in the trust region subproblem. Then, we suggest an adaptive nonmonotone trust region algorithm with a simple quadratic model. Under proper conditions, it is briefly shown that the proposed algorithm is globally and locally superlinearly convergent. Numerical experiments are done on a set of unconstrained optimization test problems of the CUTEr collection, using the Dolan-Mor\u00e9 performance profile. They demonstrate efficiency of the proposed algorithm.<\/jats:p>","DOI":"10.1051\/ro\/2017057","type":"journal-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T06:55:27Z","timestamp":1500965727000},"page":"829-839","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems"],"prefix":"10.1051","volume":"53","author":[{"given":"Saeed","family":"Rezaee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saman","family":"Babaie-Kafaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.camwa.2010.04.034","volume":"60","author":"Ahookhoosh","year":"2010","journal-title":"Comput. Math. Appl."},{"key":"R2","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","volume":"204","author":"Andrei","year":"2010","journal-title":"European J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10288-013-0233-4","volume":"11","author":"Babaie-Kafaki","year":"2013","journal-title":"4OR"},{"key":"R4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10957-015-0724-x","volume":"167","author":"Babaie-Kafaki","year":"2015","journal-title":"J. Optim. Theory Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"Barzilai","year":"1988","journal-title":"IMA J. Numer. Anal."},{"key":"R6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"Cartis","year":"2011","journal-title":"Math. Program."},{"key":"R7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"9","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"R8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"Gould","year":"2003","journal-title":"ACM Trans. Math. Softw."},{"key":"R9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"Hager","year":"2006","journal-title":"ACM Trans. Math. Softw."},{"key":"R10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"Li","year":"2001","journal-title":"J. Comput. Appl. Math."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"Li","year":"2001","journal-title":"SIAM J. Optim."},{"key":"R12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Nesterov","year":"2008","journal-title":"Math. Program."},{"key":"R13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Nesterov","year":"2006","journal-title":"Math. Program."},{"key":"R14","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"Oren","year":"1974","journal-title":"Management Sci."},{"key":"R15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"Oren","year":"1976","journal-title":"Math. Program."},{"key":"R16","first-page":"95","volume":"5","author":"Saeidian","year":"2015","journal-title":"Iranian J. Numer. Anal. Optim."},{"key":"R17","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.cam.2009.06.027","volume":"232","author":"Sang","year":"2009","journal-title":"J. Comput. Appl. Math."},{"key":"R18","unstructured":"Sun W. and Yuan Y.X., Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"Toint","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"R20","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1360\/02ys9067","volume":"45","author":"Zhang","year":"2002","journal-title":"Sci. China Ser. A Math."},{"key":"R21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.cam.2014.04.026","volume":"272","author":"Zhou","year":"2014","journal-title":"J. Comput. Appl. Math."},{"key":"R22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s12190-012-0572-x","volume":"40","author":"Zhou","year":"2012","journal-title":"J. Appl. Math. Comput."},{"key":"R23","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1080\/10556780500137041","volume":"21","author":"Zhou","year":"2006","journal-title":"Optim. Methods Softw."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1137\/S1052623498331793","volume":"9","author":"Zhu","year":"1999","journal-title":"SIAM J. Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017057\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T19:20:56Z","timestamp":1719343256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":24,"journal-issue":{"issue":"3"},"alternative-id":["ro170036"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017057","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,25]]}}}