{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:57:12Z","timestamp":1773752232322,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1016\/j.amc.2005.03.004","type":"journal-article","created":{"date-parts":[[2006,2,4]],"date-time":"2006-02-04T15:29:32Z","timestamp":1139066972000},"page":"1000-1017","source":"Crossref","is-referenced-by-count":25,"title":["A trust region filter method for general non-linear programming"],"prefix":"10.1016","volume":"172","author":[{"given":"Pu-yan","family":"Nie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-feng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2005.03.004_bib1","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/S105262340138983X","article-title":"A pattern search filter method for nonlinear programming without derivatives","volume":"14","author":"Audet","year":"2004","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.amc.2005.03.004_bib2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10107-003-0378-6","article-title":"On the global convergence of an SLP-filter algorithm that takes EQP steps","volume":"96","author":"Chin","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.amc.2005.03.004_bib3","series-title":"Trust Region Methods","author":"Conn","year":"2000"},{"key":"10.1016\/j.amc.2005.03.004_bib4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","article-title":"Nonlinear programming without a penalty function","volume":"91","author":"Fletcher","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.amc.2005.03.004_bib5","unstructured":"R. Fletcher, S. Leyffer, P.L. Toint, On the global convergence of an SLP-filter algorithm. Tech. Report. NA\/183, Department of Mathematics, University of Dundee, 1998."},{"key":"10.1016\/j.amc.2005.03.004_bib6","unstructured":"R. Fletcher, S. Leyffer, User manual for filter SQP. Tech. Report. NA\/181, Department of Mathematics, University of Dundee, 1998."},{"key":"10.1016\/j.amc.2005.03.004_bib7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","article-title":"On the global convergence of a SQP-filter algorithm","volume":"13","author":"Fletcher","year":"2002","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.amc.2005.03.004_bib8","unstructured":"R. Fletcher, S. Leyffer, A bundle filter method for nonsmooth nonlinear optimization, Tech. Report. NA\/195, Department of Mathematics, University of Dundee, 1999."},{"key":"10.1016\/j.amc.2005.03.004_bib9","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","article-title":"Global convergence of a trust-region SQP-filter algorithm for general nonlinear","volume":"13","author":"Fletcher","year":"2003","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.amc.2005.03.004_bib10","first-page":"613","article-title":"Composite-step like filter methods for equality constraint problems","volume":"21","author":"Nie","year":"2003","journal-title":"Journal of Computational Mathematics"},{"key":"10.1016\/j.amc.2005.03.004_bib11","series-title":"Numerical Optimization","author":"Nocedal","year":"1999"},{"key":"10.1016\/j.amc.2005.03.004_bib12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","article-title":"A globally convergent primal\u2013dual interior-point filter method for nonconvex nonlinear programming","volume":"100","author":"Ulbrich","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.amc.2005.03.004_bib13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10107-003-0491-6","article-title":"On the superlinear local convergence of a filter-SQP methods","volume":"100","author":"Ulbrich","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.amc.2005.03.004_bib14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s002110050133","article-title":"On the convergence of a new trust region algorithm","volume":"70","author":"Yuan","year":"1995","journal-title":"Numerische Mathematik"},{"key":"10.1016\/j.amc.2005.03.004_bib15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580852","article-title":"On a subproblem of trust region algorithms for constrained optimization","volume":"47","author":"Yuan","year":"1990","journal-title":"Mathematical Programming"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0096300305002742?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0096300305002742?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T18:21:52Z","timestamp":1547835712000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300305002742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["S0096300305002742"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.amc.2005.03.004","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}