{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T02:10:27Z","timestamp":1719195027462},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T00:00:00Z","timestamp":1304380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10589-011-9411-5","type":"journal-article","created":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T19:27:52Z","timestamp":1304364472000},"page":"239-266","source":"Crossref","is-referenced-by-count":7,"title":["A filter trust-region algorithm for unconstrained optimization with strong global convergence properties"],"prefix":"10.1007","volume":"52","author":[{"given":"M.","family":"Fatemi","sequence":"first","affiliation":[]},{"given":"N.","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,3]]},"reference":[{"issue":"4","key":"9411_CR1","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/0729072","volume":"29","author":"J.F. Bonnans","year":"1992","unstructured":"Bonnans, J.F., Panier, E.R., Tits, A.L., Zhou, J.L.: Avoiding the Maratos effect by means of a nonmonotone line search. II. Inequality constrained problems feasible iterates. SIAM J. Numer. Anal. 29(4), 1187\u20131202 (1992)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"9411_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10107-003-0378-6","volume":"96","author":"C.M. Chin","year":"2003","unstructured":"Chin, C.M., Fletcher, R.: On the global convergence of an SLP-filter algorithm that takes EQP steps. Math. Program., Ser. A 96(1), 161\u2013177 (2003)","journal-title":"Math. Program., Ser. A"},{"key":"9411_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods, MPS\/SIAM Series on Optimization","author":"A.R. Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods, MPS\/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2000)"},{"issue":"2","key":"9411_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"Y.H. Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J.\u00a0Optim. Theory Appl. 112(2), 315\u2013330 (2002)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"2","key":"9411_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF00939608","volume":"76","author":"N.Y. Deng","year":"1993","unstructured":"Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotonic trust region algorithm. J.\u00a0Optim. Theory Appl. 76(2), 259\u2013285 (1993)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"2","key":"9411_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program., Ser. A 91(2), 201\u2013213 (2002)","journal-title":"Math. Program., Ser. A"},{"issue":"3","key":"9411_CR7","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, P.L., W\u00e4chter, A.: Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim. 13(3), 635\u2013659 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9411_CR8","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. Program., Ser. A 91(2), 239\u2013269 (2002)","journal-title":"Math. Program., Ser. A"},{"issue":"1","key":"9411_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/S1052623403422637","volume":"15","author":"N.I.M. Gould","year":"2004","unstructured":"Gould, N.I.M., Leyffer, S., Toint, P.L.: A\u00a0multidimensional filter algorithm for nonlinear equations and nonlinear least-squares. SIAM J. Optim. 15(1), 17\u201338 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9411_CR10","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N.I.M. Gould","year":"1999","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9411_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: Cuter and sifdec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9411_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/040603851","volume":"16","author":"N.I.M. Gould","year":"2005","unstructured":"Gould, N.I.M., Sainvitu, C., Toint, P.L.: A\u00a0filter-trust-region method for unconstrained optimization. SIAM J. Optim. 16(2), 341\u2013357 (2005)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9411_CR13","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L. Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A\u00a0nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9411_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L. Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A\u00a0truncated Newton method with nonmonotone line search for unconstrained optimization. J.\u00a0Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9411_CR15","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn., Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)","edition":"2"},{"key":"9411_CR16","series-title":"Appl. Optim.","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: Advances in Nonlinear Programming, Beijing, 1996. Appl. Optim., vol.\u00a014, pp.\u00a0153\u2013175. Kluwer Academic, Dordrecht (1998)"},{"issue":"1","key":"9411_CR17","first-page":"69","volume":"77","author":"P.L. Toint","year":"1997","unstructured":"Toint, P.L.: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Math. Program., Ser. A 77(1), 69\u201394 (1997)","journal-title":"Math. Program., Ser. A"},{"issue":"2","key":"9411_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","volume":"100","author":"M. Ulbrich","year":"2004","unstructured":"Ulbrich, M., Ulbrich, S., Vicente, L.N.: A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Program., Ser. A 100(2), 379\u2013410 (2004)","journal-title":"Math. Program., Ser. A"},{"issue":"1","key":"9411_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A. W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1\u201331 (2005)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9411-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9411-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9411-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:40Z","timestamp":1559302600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9411-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9411"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9411-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,3]]}}}