{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T07:46:59Z","timestamp":1770882419151,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T00:00:00Z","timestamp":1496793600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11075-017-0357-2","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T01:20:31Z","timestamp":1496798431000},"page":"1159-1182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5545-3574","authenticated-orcid":false,"given":"Dan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"issue":"1","key":"357_CR1","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"key":"357_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01403888","volume":"54","author":"A Bjorck","year":"1988","unstructured":"Bjorck, A.: A direct method for sparse least squares problems with lower and upper bounds. Numer. Math. 54, 19\u201332 (1988)","journal-title":"Numer. Math."},{"key":"357_CR3","doi-asserted-by":"crossref","unstructured":"Bongartz, I., Conn, A., Gould, N., Toint, P.: CUTE: constrained and unconstrained testing environment, Research Report, IBM T. Watson Research Center, Yorktown, USA (1995)","DOI":"10.1145\/200979.201043"},{"key":"357_CR4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"A Conn","year":"1988","unstructured":"Conn, A., Gould, N., Toint, P.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433\u2013460 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"357_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0911012","volume":"11","author":"T Coleman","year":"1990","unstructured":"Coleman, T., Hempel, C.: Computing a trust region step for a penalty function. SIAM J. Sci. Statist. Comput. 11, 180\u2013201 (1990)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"357_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"A Conn","year":"1988","unstructured":"Conn, A., Gould, N., Toint, P.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433\u2013460 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"357_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"T Coleman","year":"1994","unstructured":"Coleman, T., Li, Y.: On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds. Math. Programming 67, 189\u2013224 (1994)","journal-title":"Math. Programming"},{"issue":"3","key":"357_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"T Coleman","year":"1996","unstructured":"Coleman, T., Li, Y.: An interior trust-region approach for minimization subject to bounds. SIAM J. Optim. 6(3), 418\u2013445 (1996)","journal-title":"SIAM J. Optim."},{"key":"357_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/imamat\/14.2.159","volume":"14","author":"R Fletcher","year":"1974","unstructured":"Fletcher, R., Jackson, M.: Minimization of a quadratic function of many variables subject only to lower and upper bounds. J. Inst. Math. Appl. 14, 159\u2013174 (1974)","journal-title":"J. Inst. Math. Appl."},{"key":"357_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01584540","volume":"2","author":"R Fletcher","year":"1972","unstructured":"Fletcher, R.: An algorithm for solving linearly constrained optimization problems. Math. Programming 2, 133\u2013165 (1972)","journal-title":"Math. Programming"},{"key":"357_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Programming 91, 239\u2013269 (2002)","journal-title":"Math. Programming"},{"issue":"2","key":"357_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/040603851","volume":"16","author":"N Gould","year":"2005","unstructured":"Gould, N., Sainvitu, C., Toint, P.: A filter-trust-region method for unconstrained optimization. SIAM J. Optim. 16(2), 341\u2013357 (2005)","journal-title":"SIAM J. Optim."},{"key":"357_CR13","doi-asserted-by":"crossref","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematics System, vol. 187. Springer (1981)","DOI":"10.1007\/978-3-642-48320-2"},{"key":"357_CR14","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/S1052623493262993","volume":"8","author":"M Lalee","year":"1998","unstructured":"Lalee, M., Nocedal, J., Plantenga, T.: On the implementation of an algorithm for large-scale equality constrained optimization. SIAM J. Optim. 8, 682\u2013706 (1998)","journal-title":"SIAM J. Optim."},{"key":"357_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-3335-7_7","volume-title":"Advances in Nonlinear Programming","author":"J Nocedal","year":"1998","unstructured":"Nocedal, J., Yuan, Y.: Combining trust region and line search techniques. In: Yuan, Y. (ed.) Advances in Nonlinear Programming, pp. 153\u2013175. Kluwer, Dordrecht (1998)"},{"key":"357_CR16","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J Ortega","year":"1970","unstructured":"Ortega, J., Rheinboldt, W.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"357_CR17","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1080\/00207160.2013.863282","volume":"8","author":"Y Pei","year":"2014","unstructured":"Pei, Y., Zhu, D.: A trust-region algorithm combining line search filter technique for nonlinear constrained optimization. Int. J. Comput. Math. 8, 1817\u20131839 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"357_CR18","first-page":"1","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Comput. 16, 1\u201331 (2005)","journal-title":"SIAM J. Comput."},{"key":"357_CR19","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/S1052623403426544","volume":"6","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 6, 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"357_CR20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01586934","volume":"51","author":"E Yang","year":"1991","unstructured":"Yang, E., Tolle, J.: A class of methods for solving large convex quadratic programs subject to box constraints. Math. Programming 51, 223\u2013228 (1991)","journal-title":"Math. Programming"},{"key":"357_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0377-0427(02)00870-1","volume":"155","author":"D Zhu","year":"2003","unstructured":"Zhu, D.: Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization. J. Comput. Appl. Math. 155, 285\u2013305 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"357_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.cam.2005.01.013","volume":"184","author":"D Zhu","year":"2005","unstructured":"Zhu, D.: An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems. J. Comput. Appl. Math. 184, 343\u2013361 (2005)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0357-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0357-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0357-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T13:53:30Z","timestamp":1569419610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0357-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,7]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["357"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0357-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,7]]}}}