{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:46:57Z","timestamp":1725630417923},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1016\/j.aml.2010.02.005","type":"journal-article","created":{"date-parts":[[2010,2,20]],"date-time":"2010-02-20T04:47:47Z","timestamp":1266641267000},"page":"670-675","source":"Crossref","is-referenced-by-count":4,"title":["A new norm-relaxed SQP algorithm with global convergence"],"prefix":"10.1016","volume":"23","author":[{"given":"Hai-Yan","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Jin-Bao","family":"Jian","sequence":"additional","affiliation":[]},{"given":"Chun-Ming","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Ran","family":"Quan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.aml.2010.02.005_b1","series-title":"Proceedings of 1077 Dundee Biennial Conference on Numerical Analysis","first-page":"144","article-title":"A fast algorithm for nonlinearly constrained optimization calculations","author":"Powell","year":"1978"},{"key":"10.1016\/j.aml.2010.02.005_b2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02190059","article-title":"Norm-relaxed method of feasible direction for solving the nonlinear programming problems","volume":"83","author":"Cawood","year":"1994","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.aml.2010.02.005_b3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0096-3003(98)10025-5","article-title":"A generalization of the norm-relaxed method of feasible directions","volume":"102","author":"Chen","year":"1999","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.aml.2010.02.005_b4","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.aml.2010.02.005_b5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0096-3003(02)00832-9","article-title":"A new SQP method of feasible directions for nonlinear programming","volume":"148","author":"Zhu","year":"2004","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.aml.2010.02.005_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2004.08.009","article-title":"A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization","volume":"168","author":"Jian","year":"2005","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.aml.2010.02.005_b7","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.cam.2005.11.004","article-title":"A variant of SQP method for inequality constrained optimization and its global convergence","volume":"197","author":"Mo","year":"2006","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.aml.2010.02.005_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-007-0180-y","article-title":"Global convergence of an SQP method without boundedness assumptions on any of iterative sequences","volume":"118","author":"Solodov","year":"2009","journal-title":"Math. Program."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965910000443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965910000443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T23:22:47Z","timestamp":1544656967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965910000443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0893965910000443"],"URL":"https:\/\/doi.org\/10.1016\/j.aml.2010.02.005","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}