{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:30:00Z","timestamp":1781332200132,"version":"3.54.1"},"reference-count":31,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2021,2,1]]},"DOI":"10.1080\/00207160.2020.1738406","type":"journal-article","created":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T04:48:00Z","timestamp":1583383680000},"page":"271-287","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":9,"title":["An improvement of adaptive cubic regularization method for unconstrained optimization problems"],"prefix":"10.1080","volume":"98","author":[{"given":"T.","family":"Dehghan Niri","sequence":"first","affiliation":[{"name":"Department of Mathematics, Yazd University, Yazd, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Heydari","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Yazd University, Yazd, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. M.","family":"Hosseini","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-011-9502-5"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2011.07.021"},{"key":"CIT0003","first-page":"147","volume":"10","author":"Andrei N.","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"CIT0004","unstructured":"N. Andrei, Test functions for unconstrained optimization, (2004). 8\u201310, Averescu Avenue, Sector 1, Bucharest, Romania. Academy of Romanian Scientists."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9626-8"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9929-2"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1155213"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9672-x"},{"key":"CIT0009","unstructured":"Y. Carmon and John C. Duchi, Gradient descent efficiently finds the cubic-regularized non-convex Newton step, (2017, 27 Jan). Available at arXiv:1612.00547v2 [math. OC]."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0286-5"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0337-y"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120945"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"CIT0014","author":"Cristofari A.","year":"2018","journal-title":"Optim. Lett."},{"key":"CIT0015","unstructured":"The CUTEr\/st test problem set. Available at http:\/\/www.cuter.rl.ac.uk\/Problems\/mastsif.shtml."},{"key":"CIT0016","first-page":"115","volume":"12","author":"Dehghan Niri T.","year":"2018","journal-title":"J. Math. Ext."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2019.1607844"},{"key":"CIT0018","first-page":"69","volume":"7","author":"Dehghan Niri T.","year":"2019","journal-title":"Comput. Methods Differ. Equ."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-011-9446-7"},{"key":"CIT0021","unstructured":"A. Griewank, The modification of Newtons method for unconstrained optimization by bounding cubic terms, Tech. Rep. NA, 12 (1981), Department of Applied Mathematics and Theoretical Physics, University of Cambridge, UK, 1981."},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1137\/0723046"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940345"},{"key":"CIT0024","author":"Momeni M.","year":"2018","journal-title":"Optim. Methods Softw."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1145\/355934.355936"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1080\/08927020600643812"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0089-x"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"J. Nocedal and Y. Yuan, Combining trust region and line search techniques, in Advances in Nonlinear Programming, Y. Yuan, ed., Dordrecht: Kluwer Academic Publishers, 1996, pp. 153\u2013175.","DOI":"10.1007\/978-1-4613-3335-7_7"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403428208"},{"key":"CIT0031","unstructured":"Y. Zheng and B. Zheng, A modified adaptive cubic regularization method for large-scale unconstrained optimization problem, (16 Apr 2019). arXiv:1904.07440v1 [math.OC]."}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2020.1738406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T19:05:27Z","timestamp":1620241527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2020.1738406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2,1]]}},"alternative-id":["10.1080\/00207160.2020.1738406"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2020.1738406","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,11]]},"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":"2019-09-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}