{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:42Z","timestamp":1743135642229,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":18,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_676","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:08:03Z","timestamp":1219662483000},"page":"3878-3884","source":"Crossref","is-referenced-by-count":0,"title":["Successive Quadratic Programming: Solution by Active Sets and Interior Point Methods"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Lucia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"676_CR1_676","first-page":"143","volume-title":"Nonlinear programming","author":"E.M.L. Beale","year":"1967","unstructured":"Beale EML (1967) An introduction to Beale's method of quadratic programming. In: Abadie J (ed) Nonlinear programming. North-Holland, Amsterdam, pp 143\u2013153"},{"key":"676_CR2_676","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0024-3795(80)90172-X","volume":"34","author":"J.R. Bunch","year":"1980","unstructured":"Bunch JR, Kaufman L (1980) A\u00a0computational method for indefinite quadratic programming problems. Linear Alg Appl 34:341\u2013370","journal-title":"Linear Alg. Appl."},{"key":"676_CR3_676","volume-title":"Linear programming and its extensions","author":"G. Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear programming and its extensions. Princeton Univ. Press, Princeton"},{"key":"676_CR4_676","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0121178","volume":"31","author":"R.S. Dembo","year":"1987","unstructured":"Dembo RS, Steihaug T (1987) Truncated Newton algorithms for large-scale unconstrained optimization. Math Program Stud 31:43\u201371","journal-title":"Math. Program. Stud."},{"key":"676_CR5_676","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/7.1.76","volume":"7","author":"R. Fletcher","year":"1971","unstructured":"Fletcher R (1971) A\u00a0general quadratic programming algorithm. J\u00a0Inst Math Appl 7:76\u201391","journal-title":"J. Inst. Math. Appl."},{"key":"676_CR6_676","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"P.E. Gill","year":"1978","unstructured":"Gill PE, Murray W (1978) Numerically stable methods for quadratic programming. Math Program 14:349\u2013372","journal-title":"Math. Program."},{"key":"676_CR7_676","doi-asserted-by":"crossref","unstructured":"Gill PE, Murray W, Ponceleon DB, Saunders MA (1991) Solving reduced KKT systems in barrier methods for linear and quadratic programming. SOL Report Dept Oper Res Stanford Univ 91-7","DOI":"10.21236\/ADA239191"},{"key":"676_CR8_676","unstructured":"Gill PE, Murray W, Saunders MA, Wright MH (1987) A\u00a0Schur complement method for sparse quadratic programming. SOL Report Dept Oper Res Stanford Univ 87(12)"},{"key":"676_CR9_676","volume-title":"Practical optimization","author":"P.E. Gill","year":"1981","unstructured":"Gill PE, Murray W, Wright MH (1981) Practical optimization. Acad. Press, New York"},{"key":"676_CR10_676","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580651","volume":"10","author":"D. Goldfarb","year":"1975","unstructured":"Goldfarb D (1975) Matrix factorizations in optimization of nonlinear functions subject to linear constraints. Math Program 10:1\u201331","journal-title":"Math. Program."},{"key":"676_CR11_676","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1991","unstructured":"Goldfarb D, Liu S (1991) An $$ O(n^3) $$ primal interior point algorithm for convex quadratic programming. Math Program 49:325\u2013340","journal-title":"Math. Program."},{"key":"676_CR12_676","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02023172","volume":"42","author":"A. Lucia","year":"1993","unstructured":"Lucia A, Xu J, D'Couto GC (1993) Sparse quadratic programming in chemical process optimization. Ann Oper Res 42:55\u201383","journal-title":"Ann. Oper. Res."},{"key":"676_CR13_676","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1016\/0098-1354(95)00237-5","volume":"20","author":"A. Lucia","year":"1996","unstructured":"Lucia A, Xu J, Layn KM (1996) Nonconvex process optimization. Comput Chem Eng 20:1375\u20131398","journal-title":"Computers Chem. Engin."},{"key":"676_CR14_676","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF00940348","volume":"60","author":"R.H. Nickel","year":"1989","unstructured":"Nickel RH, Tolle JW (1989) A\u00a0sparse sequential quadratic programming algorithm. J\u00a0Optim Th Appl 60:453\u2013473","journal-title":"J. Optim. Th. Appl."},{"key":"676_CR15_676","series-title":"Lecture Notes Math.","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical analysis, Dundee, 1977","author":"M.J.D. Powell","year":"1978","unstructured":"Powell MJD (1978) A\u00a0fast algorithm for nonlinearly constrained optimization: calculations. In: Watson G (ed) Numerical analysis, Dundee, 1977. Lecture Notes Math. Springer, Berlin, pp 144\u2013157"},{"key":"676_CR16_676","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y. Saad","year":"1986","unstructured":"Saad Y, Schultz MH (1986) GMRES: A\u00a0generalized minimal residual algorithm for solving nonsymmetric linear equations. SIAM J Sci Statist Comput 7:856\u2013870","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"676_CR17_676","doi-asserted-by":"publisher","first-page":"382","DOI":"10.2307\/1909468","volume":"27","author":"P. Wolfe","year":"1959","unstructured":"Wolfe P (1959) The simplex method for quadratic programming. Econometrica 27:382\u2013398","journal-title":"Econometrica"},{"key":"676_CR18_676","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4613-9617-8_3","volume-title":"Progress in Mathematical Programming","author":"Y.Y. Ye","year":"1989","unstructured":"Ye YY (1989) An extension of Karmarkar's algorithm and the trust region method for quadratic programming. In: Megiddo N (ed) Progress in Mathematical Programming. Springer, Berlin, pp 49\u201364"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:48:46Z","timestamp":1720694926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_676","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}