乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T14:34:37Z","timestamp":1713364477655},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"DOI":"10.1016\/j.amc.2004.09.018","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T15:43:20Z","timestamp":1103125400000},"page":"651-676","source":"Crossref","is-referenced-by-count":1,"title":["An inexact Newton method combined with Hestenes multipliers\u2019 scheme for the solution of Karush\u2013Kuhn\u2013Tucker systems"],"prefix":"10.1016","volume":"168","author":[{"given":"Silvia","family":"Bonettini","sequence":"first","affiliation":[]},{"given":"Emanuele","family":"Galligani","sequence":"additional","affiliation":[]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2004.09.018_bib1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0719025","article-title":"Inexact Newton methods","volume":"19","author":"Dembo","year":"1982","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.amc.2004.09.018_bib2","series-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"Dennis","year":"1983"},{"key":"10.1016\/j.amc.2004.09.018_bib3","unstructured":"I.S. Duff, J.K. Reid, MA27-a set of Fortran subroutines for solving sparse symmetric sets of linear equations, Tech Report AERE R10533, HMSO, London, 1982."},{"key":"10.1016\/j.amc.2004.09.018_bib4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1004624721836","article-title":"On the Newton interior-point method for nonlinear programming problems","volume":"104","author":"Durazzi","year":"2000","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib5","first-page":"71","article-title":"Nonlinear programming methods for solving optimal control problems","volume":"vol. 58","author":"Durazzi","year":"2001"},{"key":"10.1016\/j.amc.2004.09.018_bib6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:JOTA.0000012969.51013.2c","article-title":"Global convergence of the Newton interior-point method for nonlinear programming","volume":"120","author":"Durazzi","year":"2004","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib7","doi-asserted-by":"crossref","unstructured":"C. Durazzi, V. Ruggiero, A Newton inexact interior-point method for large scale nonlinear optimization problems, Annali Univ. Ferrara, Sez. VII, Sc. Matem. IL, (2003) 333\u2013357.","DOI":"10.1007\/BF02844922"},{"key":"10.1016\/j.amc.2004.09.018_bib8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1017523228692","article-title":"Parallel interior-point method for linear and quadratic programs with special structure","volume":"110","author":"Durazzi","year":"2001","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0804022","article-title":"Globally convergent inexact Newton methods","volume":"4","author":"Eisenstat","year":"1994","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.amc.2004.09.018_bib10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF02275347","article-title":"On the formulation and theory of Newton interior-point method for nonlinear programming","volume":"89","author":"El-Bakry","year":"1996","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib11","unstructured":"E. Galligani, Analysis of the convergence of an inexact Newton method for solving Karush\u2013Kuhn\u2013Tucker systems, Atti Sem. Matem. Fis. Univ. Modena, in press."},{"key":"10.1016\/j.amc.2004.09.018_bib12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF01585660","article-title":"On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem","volume":"32","author":"Gould","year":"1985","journal-title":"Math. Program."},{"key":"10.1016\/j.amc.2004.09.018_bib13","series-title":"Optimization Theory. The Finite Dimensional Case","author":"Hestenes","year":"1975"},{"key":"10.1016\/j.amc.2004.09.018_bib14","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/0614019","article-title":"On finding supernodes for sparse matrix computations","volume":"14","author":"Liu","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib15","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/j.amc.2004.09.018_bib16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1008725519350","article-title":"Optimization techniques for solving elliptic control problems with control and state constraints: Part 1. Boundary control","volume":"16","author":"Maurer","year":"2000","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1008774521095","article-title":"Optimization techniques for solving elliptic control problems with control and state constraints: Part 2. Distributed control","volume":"18","author":"Maurer","year":"2001","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.amc.2004.09.018_bib18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0377-0427(00)00309-5","article-title":"Solving elliptic control problems with interior point and SQP methods: control and state constraint","volume":"120","author":"Mittelmann","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.amc.2004.09.018_bib19","series-title":"Numerical Optimization","author":"Nocedal","year":"1999"},{"key":"10.1016\/j.amc.2004.09.018_bib20","series-title":"Methods for Solving Systems of Nonlinear Equations","author":"Rheinboldt","year":"1998"},{"key":"10.1016\/j.amc.2004.09.018_bib21","series-title":"Iterative Methods for Sparse Linear System","author":"Saad","year":"1996"},{"key":"10.1016\/j.amc.2004.09.018_bib22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","article-title":"An interior-point algorithm for nonconvex nonlinear programming","volume":"13","author":"Vanderbei","year":"1999","journal-title":"Comput. Optim. Appl."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300304006307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300304006307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T22:28:44Z","timestamp":1682893724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300304006307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S0096300304006307"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2004.09.018","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}