{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:54:50Z","timestamp":1761580490089},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf02591884","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:39:01Z","timestamp":1175182741000},"page":"176-195","source":"Crossref","is-referenced-by-count":25,"title":["A weighted gram-schmidt method for convex quadratic programming"],"prefix":"10.1007","volume":"30","author":[{"given":"Philip E.","family":"Gill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas I. M.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Murray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margaret H.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591884_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/B978-0-12-597050-1.50009-9","volume-title":"Nonlinear programming","author":"R.H. Bartels","year":"1970","unstructured":"R.H. Bartels, G.H. Golub and M.A. Saunders, \u201cNumerical techniques in mathematical programming\u201d, in: J.B. Rosen, Q.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, London and New York, 1970) pp. 123\u2013176."},{"key":"BF02591884_CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0024-3795(80)90172-X","volume":"34","author":"J.R. Bunch","year":"1980","unstructured":"J.R. Bunch and L.C. Kaufman, \u201cA computational method for the indefinite quadratic programming problem\u201d,Linear Algebra and its Applications 34 (1980) 341\u2013370.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02591884_CR3","first-page":"772","volume":"30","author":"J.W. Daniel","year":"1976","unstructured":"J.W. Daniel, W.B. Gragg, L.C. Kaufman and G.W. Stewart, \u201cReorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization\u201d,Mathematics of Computation 30 (1976) 772\u2013795.","journal-title":"Mathematics of Computation"},{"key":"BF02591884_CR4","series-title":"Technical Report","volume-title":"An active set algorithm for convex quadratic programming","author":"A. Dax","year":"1981","unstructured":"A. Dax, \u201cAn active set algorithm for convex quadratic programming\u201d, Technical Report, Hydrological Service (Jerusalem, Israel, 1981)."},{"key":"BF02591884_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/7.1.76","volume":"7","author":"R. Fletcher","year":"1971","unstructured":"R. Fletcher, \u201cA general quadratic programming algorithm\u201d,Journal of the Institute of Mathematics and its Applications 7 (1971) 76\u201391.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"BF02591884_CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"P.E. Gill","year":"1978","unstructured":"P.E. Gill and W. Murray, \u201cNumerically stable methods for quadratic programming\u201d,Mathematical Programming 14 (1978) 349\u2013372.","journal-title":"Mathematical Programming"},{"key":"BF02591884_CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill, G.H. Golub, W. Murray and M.A. Saunders, \u201cMethods for modifying matrix factorizations\u201d,Mathematics of Computation 28 (1974) 505\u2013535.","journal-title":"Mathematics of Computation"},{"key":"BF02591884_CR8","series-title":"Technical Report SOL 82-14","doi-asserted-by":"crossref","DOI":"10.21236\/ADA121336","volume-title":"Range-space methods for convex quadratic programming","author":"P.E. Gill","year":"1982","unstructured":"P.E. Gill, N.I.M. Gould, W. Murray, M.A. Saunders and M.H. Wright, \u201cRange-space methods for convex quadratic programming\u201d, Technical Report SOL 82-14, Department of Operations Research, Stanford University (Stanford, CA, 1982)."},{"key":"BF02591884_CR9","volume-title":"Practical optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical optimization (Academic Press, London and New York, 1981)."},{"key":"BF02591884_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580651","volume":"10","author":"D. Goldfarb","year":"1976","unstructured":"D. Goldfarb, \u201cMatrix factorizations in optimization of nonlinear functions subject to linear constraints\u201d,Mathematical Programming 10 (1976) 1\u201331.","journal-title":"Mathematical Programming"},{"key":"BF02591884_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D. Goldfarb","year":"1983","unstructured":"D. Goldfarb and A. Idnani, \u201cA numerically stable dual method for solving strictly convex quadratic programs\u201d,Mathematical Programming 27 (1983) 1\u201333.","journal-title":"Mathematical Programming"},{"key":"BF02591884_CR12","series-title":"Report NAC","volume-title":"An algorithm for finding a local minimum of an indefinite quadratic program","author":"W. Murray","year":"1971","unstructured":"W. Murray, \u201cAn algorithm for finding a local minimum of an indefinite quadratic program\u201d, Report NAC 1, National Physical Laboratory (Teddington, England, 1971)."},{"key":"BF02591884_CR13","first-page":"1","volume-title":"Nonlinear programming","author":"M.J.D. Powell","year":"1981","unstructured":"M.J.D. Powell, \u201cAn upper-triangular matrix method for quadratic programming\u201d, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 4 (Academic Press, London and New York, 1981) pp. 1\u201324."},{"key":"BF02591884_CR14","series-title":"Report SOL 82-4","doi-asserted-by":"crossref","DOI":"10.21236\/ADA115667","volume-title":"On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function","author":"K. Schittkowski","year":"1982","unstructured":"K. Schittkowski, \u201cOn the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function\u201d, Report SOL 82-4, Department of Operations Research, Stanford University (Stanford, CA, 1982)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591884.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591884\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:50Z","timestamp":1558395470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF02591884"],"URL":"https:\/\/doi.org\/10.1007\/bf02591884","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}