{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:50:32Z","timestamp":1774507832688,"version":"3.50.1"},"reference-count":29,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2024,5,3]]},"DOI":"10.1080\/00207160.2024.2350447","type":"journal-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T05:56:14Z","timestamp":1715147774000},"page":"512-523","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A nonmonotone adaptive trust region technique with a forgetting factor"],"prefix":"10.1080","volume":"101","author":[{"given":"Zeinab","family":"Saeidian","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, University of Kashan, Kashan, Iran"}]},{"given":"Zohre","family":"Aminifard","sequence":"additional","affiliation":[{"name":"ICTEAM\/INMA, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Saman","family":"Babaie\u2013Kafaki","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Free University of Bozen\u2013Bolzano, Bolzano, Italy"}]}],"member":"301","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2011.07.021"},{"issue":"4","key":"e_1_3_4_3_1","first-page":"819","article-title":"A limited memory trust region method with adaptive radius for large scale unconstrained optimization","volume":"42","author":"Ahookhosh M.","year":"2016","unstructured":"M. Ahookhosh, K. Amini, M. Kimiaei, and M.R. Peyghami, A limited memory trust region method with adaptive radius for large scale unconstrained optimization, Bull. Iranian Math. Soc. 42(4) (2016), pp. 819\u2013837.","journal-title":"Bull. Iranian Math. Soc."},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-017-0406-x"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-019-00658-1"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9460-4"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2004.842874"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2016.0202"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_3_4_10_1","unstructured":"J.Y. Fan and Y.X. Yuan A new trust region algorithm with trust region radius converging to zero in Li di D. (Ed.) Proceedings of the 5th International Conference on Optimization: Techniques and Applications Hong Kong 2001 pp. 786\u2013794."},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/962437.962439"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0723046"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132979"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(82)80014-5"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.851110"},{"key":"e_1_3_4_16_1","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","unstructured":"J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 2006."},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9726-8"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2008.2001559"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1364738"},{"key":"e_1_3_4_20_1","first-page":"95","article-title":"An adaptive nonmonotone trust region method for unconstraint optimization problems based on a simple subproblem","volume":"2","author":"Saeidian Z.","year":"2015","unstructured":"Z. Saeidian and M.R. Peyghami, An adaptive nonmonotone trust region method for unconstraint optimization problems based on a simple subproblem, Iran. J. Numer. Anal. Optim. 2 (2015), pp. 95\u2013117.","journal-title":"Iran. J. Numer. Anal. Optim."},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2009.06.027"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595286955"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0252-9602(18)30762-8"},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2007.01.027"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2003.07.008"},{"key":"e_1_3_4_26_1","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"Sun W.","year":"2006","unstructured":"W. Sun and Y.X. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006."},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S106482759427021X"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S106482759427021X"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.08.027"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1360\/02ys9067"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2024.2350447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T14:18:40Z","timestamp":1727187520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2024.2350447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,3]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5,3]]}},"alternative-id":["10.1080\/00207160.2024.2350447"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2024.2350447","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,3]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-03-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-14","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}