{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T19:44:18Z","timestamp":1724701458855},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"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,11]]},"DOI":"10.1016\/j.amc.2006.04.073","type":"journal-article","created":{"date-parts":[[2006,9,8]],"date-time":"2006-09-08T15:25:10Z","timestamp":1157729110000},"page":"987-998","source":"Crossref","is-referenced-by-count":21,"title":["A simple feasible SQP algorithm for inequality constrained optimization"],"prefix":"10.1016","volume":"182","author":[{"given":"Zhibin","family":"Zhu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.amc.2006.04.073_bib1","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/0729072","article-title":"Avoiding the Maratos effect by means of a nonmonotone line search","volume":"29","author":"Bonnans","year":"1992","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.amc.2006.04.073_bib2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-247X(89)90111-X","article-title":"A sequential quadratic programming algorithm for potentially infeasible mathematical programs","volume":"139","author":"Burke","year":"1989","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/j.amc.2006.04.073_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","article-title":"The watchdog technique for forcing convergence in algorithms for constrained optimization","volume":"16","author":"Chamberlain","year":"1982","journal-title":"Math. Program. Study"},{"issue":"2","key":"10.1016\/j.amc.2006.04.073_bib4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02192227","article-title":"Quadratically and superlinearly convergent for the solution of inequality constrained optimization problem","volume":"85","author":"Facchinei","year":"1995","journal-title":"JOTA"},{"issue":"3","key":"10.1016\/j.amc.2006.04.073_bib5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","article-title":"A globally convergent method for nonlinear programming","volume":"22","author":"Han","year":"1977","journal-title":"JOTA"},{"key":"10.1016\/j.amc.2006.04.073_bib6","article-title":"Test examples for nonlinear programming codes","volume":"vol. 187","author":"Hock","year":"1981"},{"key":"10.1016\/j.amc.2006.04.073_bib7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0096-3003(99)00176-9","article-title":"A superlinearly convergent method of feasible directions","volume":"116","author":"Kostreva","year":"2000","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.amc.2006.04.073_bib8","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1137\/S1052623498344562","article-title":"A computationally efficient feasible sequential quadratic programming algorithm","volume":"11","author":"Lawrence","year":"2001","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.amc.2006.04.073_bib9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01581247","article-title":"On combining feasibility descent and superlinear convergence in inequality constrained optimization","volume":"59","author":"Panier","year":"1993","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.amc.2006.04.073_bib10","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1137\/0326046","article-title":"A QP-free global convergent, locally superlinearly convergent algorithm for inequality constrained optimization","volume":"26","author":"Panier","year":"1988","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"10.1016\/j.amc.2006.04.073_bib11","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/0325051","article-title":"A superlinearly convergent feasible method for the solution of inequality constrained optimization problems","volume":"25","author":"Panier","year":"1987","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/j.amc.2006.04.073_bib12","series-title":"Numerical Analysis","first-page":"144","article-title":"A fast algorithm for nonlinearly constrained optimization calculations","author":"Powell","year":"1978"},{"key":"10.1016\/j.amc.2006.04.073_bib13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF00940684","article-title":"Exact penalty function algorithm with simple updating of the penalty parameter","volume":"69","author":"Pantoja","year":"1991","journal-title":"JOTA"},{"key":"10.1016\/j.amc.2006.04.073_bib14","unstructured":"R.B. Wilson, A simplicial algorithm for concave programming, Ph.D. thesis, Harvard University, Graduate School of Business Administration, 1963."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306004139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300306004139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,13]],"date-time":"2019-01-13T07:50:34Z","timestamp":1547365834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300306004139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["S0096300306004139"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2006.04.073","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}