{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:30:01Z","timestamp":1776357001262,"version":"3.51.2"},"reference-count":26,"publisher":"Informa UK Limited","issue":"8","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371253"],"award-info":[{"award-number":["11371253"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2018,8,3]]},"DOI":"10.1080\/00207160.2017.1329530","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T03:33:50Z","timestamp":1494560030000},"page":"1494-1526","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":73,"title":["An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization"],"prefix":"10.1080","volume":"95","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5545-3574","authenticated-orcid":false,"given":"Dan","family":"Li","sequence":"first","affiliation":[{"name":"Mathematics and Science College, Shanghai Normal University, Shanghai, China"}]},{"given":"Detong","family":"Zhu","sequence":"additional","affiliation":[{"name":"Mathematics and Science College, Shanghai Normal University, Shanghai, China"}]}],"member":"301","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"CIT0001","first-page":"147","volume":"10","author":"Andrei N.","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/0806023"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011369"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1988-0929544-3"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939608"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"CIT0007","volume-title":"Practical Methods of Optimization, Vol. I: Unconstrained Optimization; Vol. II: Constrained Optimization","author":"Fletcher R.","year":"1980"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100244"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/040603851"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1137\/0723046"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-012-0036-2"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"J. Nocedal and Y. Yuan,Combining trust region and line search techniques, inAdvances in Nonlinear Programming, Y. Yuan, eds. Kluwer, Dordrecht, 1998, pp. 153\u2013175.","DOI":"10.1007\/978-1-4613-3335-7_7"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/0803021"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2013.863282"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591998"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61582-5"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1137\/0719026"},{"key":"CIT0020","first-page":"1","volume":"16","author":"W\u00e4chter A.","year":"2005","journal-title":"SIAM J. Comput."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403426544"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1080\/01630563.2010.496302"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.959942"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(03)00458-8"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(02)00870-1"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s10255-007-7029-2"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2017.1329530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T10:22:12Z","timestamp":1569320532000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2017.1329530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":26,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2017,6,8]]},"published-print":{"date-parts":[[2018,8,3]]}},"alternative-id":["10.1080\/00207160.2017.1329530"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2017.1329530","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]},"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"}]}}