{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:58:37Z","timestamp":1781369917840,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"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":[[1983,9]]},"DOI":"10.1007\/bf02591962","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:36:08Z","timestamp":1175182568000},"page":"1-33","source":"Crossref","is-referenced-by-count":809,"title":["A numerically stable dual method for solving strictly convex quadratic programs"],"prefix":"10.1007","volume":"27","author":[{"given":"D.","family":"Goldfarb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Idnani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02591962_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, O.I. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970) pp. 123\u2013176."},{"key":"BF02591962_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, \u201cOn minimizing a convex function subject to linear inequalities,\u201dJournal of the Royal Statistical Society Series B 17 (1955) 173\u2013184.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"BF02591962_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800060305","volume":"6","author":"E.M.L. Beale","year":"1959","unstructured":"E.M.L. Beale, \u201cOn quadratic programming,\u201dNaval Research Logistics Quarterly 6 (1959) 227\u2013243.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591962_CR4","first-page":"341","volume-title":"Towards global optimization","author":"M.G. Biggs","year":"1975","unstructured":"M.G. Biggs, \u201cConstrained minimization using recursive quadratic programming: some alternative subproblem formulations,\u201d in: L.C.W. Dixon and G.P. Szego, eds.,Towards global optimization (North-Holland, Amsterdam, 1975) pp. 341\u2013349."},{"key":"BF02591962_CR5","series-title":"Computing Science Technical Report","volume-title":"Indefinite quadratic programming","author":"J.W. Bunch","year":"1977","unstructured":"J.W. Bunch and L. Kaufman, \u201cIndefinite quadratic programming,\u201d Computing Science Technical Report 61, Bell. Labs, Murray Hill. NJ (1977)."},{"key":"BF02591962_CR6","series-title":"Department of Combinatorics and Optimization Research Report CORR 75-15","volume-title":"Quadratic programming via a nondifferentiable penalty function","author":"A.R. Conn","year":"1975","unstructured":"A.R. Conn and J.W. Sinclair, \u201cQuadratic programming via a nondifferentiable penalty function,\u201d Department of Combinatorics and Optimization Research Report CORR 75-15, University of Waterloo, Waterloo, Ont. (1975)."},{"key":"BF02591962_CR7","first-page":"115","volume-title":"Lectures in applied mathematics II, Mathematics of the decision sciences, Part 1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming,\u201d in: G.B. Dantzig and A.F. Veinott, eds.Lectures in applied mathematics II, Mathematics of the decision sciences, Part 1 (American Mathematical Society, Providence, RI, 1968) pp 115\u2013136."},{"key":"BF02591962_CR8","first-page":"772","volume":"30","author":"J.W. Daniel","year":"1976","unstructured":"J.W. Daniel, W.B. Graggs, L. Kaufman and G.W. Stewart, \u201cReorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorizations,\u201dMathematics of Computation 30 (1976) 772\u2013795.","journal-title":"Mathematics of Computation"},{"key":"BF02591962_CR9","series-title":"Institute of Mathematics Report","volume-title":"The gradient projection method for quadratic programming","author":"A. Dax","year":"1978","unstructured":"A. Dax \u201cThe gradient projection method for quadratic programming,\u201d Institute of Mathematics Report, The Hebrew University of Jerusalem (Jerusalem, 1978)."},{"key":"BF02591962_CR10","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963) Chapter 24, Section 4."},{"key":"BF02591962_CR11","unstructured":"R. Fletcher, \u201cThe calculation of feasible points for linearly constrained optimization problems\u201d."},{"key":"BF02591962_CR12","unstructured":"R. Fletcher, \u201cA FORTRAN subroutine for quadratic programming\u201d, UKAEA Research Group Report. AERE R6370 (1970)."},{"key":"BF02591962_CR13","doi-asserted-by":"crossref","unstructured":"R. Fletcher, \u201cA general quadratic programming algorithm\u201d,Journal of the Institute of Mathematics and Its Applications (1971) 76\u201391.","DOI":"10.1093\/imamat\/7.1.76"},{"key":"BF02591962_CR14","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,\u201dMathematics of Computation 28 (1974) 505\u2013535.","journal-title":"Mathematics of Computation"},{"key":"BF02591962_CR15","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,\u201dMathematical programming 14 (1978) 349\u2013372.","journal-title":"Mathematical programming"},{"key":"BF02591962_CR16","first-page":"239","volume-title":"Numerical methods for nonlinear optimization","author":"D. Goldfarb","year":"1972","unstructured":"D. Goldfarb, \u201cExtension of Newton's method and simplex methods for solving quadratic programs,\u201d in: F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, London, 1972) pp. 239\u2013254."},{"key":"BF02591962_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580651","volume":"10","author":"D. Goldfarb","year":"1975","unstructured":"D. Goldfarb, \u201cMatrix factorizations in optimization of nonlinear functions subject to linear constraints,\u201dMathematical Programming 10 (1975) 1\u201331.","journal-title":"Mathematical Programming"},{"key":"BF02591962_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0092976","volume-title":"Numerical Analysis, Proceedings Cocoyoc, Mexico 1981","author":"D. Goldfarb","year":"1982","unstructured":"D. Goldfarb and A. Idnani, \u201cDual and primal-dual methods for solving strictly convex quadratic programs,\u201d in: J.P. Hennart, ed.,Numerical Analysis, Proceedings Cocoyoc, Mexico 1981, Lecture Notes in Mathematics 909 (Springer-Verlag, Berlin, 1982) pp. 226\u2013239."},{"key":"BF02591962_CR19","first-page":"255","volume-title":"Numerical methods for nonlinear optimization","author":"A.S. Goncalves","year":"1972","unstructured":"A.S. Goncalves, \u201cA primal-dual method for quadratic programming with bounded variables,\u201d in F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, London, 1972) pp. 255\u2013263."},{"key":"BF02591962_CR20","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1137\/0307041","volume":"7","author":"M.D. Grigoriadis","year":"1969","unstructured":"M.D. Grigoriadis and K. Ritter, \u201cA parametric method for semidefinite quadratic programs,\u201dSIAM Journal of Control 7 (1969) 559\u2013577.","journal-title":"SIAM Journal of Control"},{"key":"BF02591962_CR21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"S-P. Han","year":"1976","unstructured":"S-P. Han, \u201cSuperlinearly convergent variable metric algorithms for general nonlinear programming problems,\u201dMathematical Programming 11 (1976) 263\u2013282.","journal-title":"Mathematical Programming"},{"key":"BF02591962_CR22","series-title":"MRC Technical Summary Report","volume-title":"Solving quadratic programs by an exact penalty function","author":"S-P. Han","year":"1981","unstructured":"S-P. Han, \u201cSolving quadratic programs by an exact penalty function,\u201d MRC Technical Summary Report No. 2180, M.R.C., University of Wisconsin (Madison, WI, 1981)."},{"key":"BF02591962_CR23","volume-title":"Extension of Newton's method for solving positive definite quadratic programs\u2014 A computational experience","author":"A.U. Idnani","year":"1973","unstructured":"A.U. Idnani, \u201cExtension of Newton's method for solving positive definite quadratic programs\u2014 A computational experience,\u201d Master's Thesis, City College of New York, Department of Computer Science (New York, 1973)."},{"key":"BF02591962_CR24","volume-title":"Numerically stable dual projection methods for solving positive definite quadratic programs","author":"A.U. Idnani","year":"1980","unstructured":"A.U. Idnani, \u201cNumerically stable dual projection methods for solving positive definite quadratic programs,\u201d Ph.D. Thesis. City College of New York. Department of Computer Science, (New York, 1980)."},{"key":"BF02591962_CR25","volume-title":"Solving least squares problems","author":"C.L. Lawson","year":"1974","unstructured":"C.L. Lawson and R.J. Hanson,Solving least squares problems (Prentice-Hall, Engelwood Cliffs, N.J., 1974)."},{"key":"BF02591962_CR26","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/mnsc.8.4.442","volume":"8","author":"C.E. Lemke","year":"1962","unstructured":"C.E. Lemke, \u201cA method of solution for quadratic programs,\u201dManagement Science 8 (1962) 442\u2013453.","journal-title":"Management Science"},{"key":"BF02591962_CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01582105","volume":"16","author":"R. Mifflin","year":"1979","unstructured":"R. Mifflin, \u201cA stable method for solving certain constrained least squares problems,\u201dMathematical Programming 16 (1979) 141\u2013158.","journal-title":"Mathematical Programming"},{"key":"BF02591962_CR28","unstructured":"W. Murray \u201cAn algorithm for finding a local minimum of an indefinite quadratic program\u201d, NPL NAC Report No. 1 (1971)."},{"key":"BF02591962_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","volume":"14","author":"B.A. Murtagh","year":"1978","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cLarge-scale linearly constrained optimization,\u201dMathematical Programming 14 (1978) 41\u201372.","journal-title":"Mathematical Programming"},{"key":"BF02591962_CR30","series-title":"Lecture Notes in Mathematics","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":"M.J.D. Powell, \u201cA fast algorithm for nonlinearly constrained optimization calculations,\u201d in:Numerical analysis, Dundee, 1977, Lecture Notes in Mathematics 630 (Springer Verlag, Berlin, 1978) pp. 144\u2013157."},{"key":"BF02591962_CR31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01589358","volume":"20","author":"M.J.D. Powell","year":"1981","unstructured":"M.J.D. Powell, \u201cAn example of cycling in a feasible point algorithm\u201d,Mathematical Programming 20 (1981) 353\u2013357.","journal-title":"Mathematical Programming"},{"key":"BF02591962_CR32","first-page":"149","volume":"6","author":"K. Ritter","year":"1962","unstructured":"K. Ritter, \u201cEin Verfahren zur L\u00f6sung parameter-abh\u00e4ngiger, nichtlinearer Maximum-Probleme\u201d,Unternehmensforschung 6 (1962) 149\u2013166: English transl.,Naval Research Logistics Quarterly 14 (1967) 147\u2013162.","journal-title":"Unternehmensforschung"},{"key":"BF02591962_CR33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"J.B. Rosen","year":"1960","unstructured":"J.B. Rosen, \u201cThe gradient projection method for nonlinear programming. Part 1. Linear constraints,\u201dSIAM Journal of Applied Mathematics 8 (1960) 181\u2013217.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"BF02591962_CR34","doi-asserted-by":"crossref","unstructured":"J.B. Rosen and S. Suzuki, \u201cConstruction of nonlinear programming test problems\u201d,Communications of the ACM (1965) 113.","DOI":"10.1145\/363744.363779"},{"key":"BF02591962_CR35","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46424-9","volume-title":"Nonlinear programming codes\u2014Information, tests, performance","author":"K. Schittkowski","year":"1980","unstructured":"K. Schittkowski,Nonlinear programming codes\u2014Information, tests, performance. Lecture Notes in Economics and Mathematical Systems, No. 183 (Springer-Verlag, Berlin, 1980)."},{"key":"BF02591962_CR36","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01404569","volume":"31","author":"K. Schittkowski","year":"1979","unstructured":"K. Schittkowski and J. Stoer, \u201cA factorization method for the solution of constrained linear least squares problems allowing subsequent data changes,\u201dNumerische Mathematik 31 (1979) 431\u2013463.","journal-title":"Numerische Mathematik"},{"key":"BF02591962_CR37","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/0708038","volume":"8","author":"J. Stoer","year":"1971","unstructured":"J. Stoer, \u201cOn the numerical solution of constrained least squares problems\u201d,SIAM Journal on Numerical Analysis 8 (1971) 382\u2013411.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"BF02591962_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.7.1.1","volume":"7","author":"H. Theil","year":"1960","unstructured":"H. Theil and C. Van De Panne, \u201cQuadratic programming as an extension of conventional quadratic maximization,\u201dManagement Science 7 (1960) 1\u201320.","journal-title":"Management Science"},{"key":"BF02591962_CR39","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1057\/jors.1964.60","volume":"15","author":"C. Panne Van de","year":"1964","unstructured":"C. Van de Panne and A. Whinston, \u201cThe simplex and the dual method for quadratic programming,\u201dOperations Research Quarterly 15 (1964) 355\u2013389.","journal-title":"Operations Research Quarterly"},{"key":"BF02591962_CR40","volume-title":"A simplicial algorithm for concave programming","author":"R.B. Wilson","year":"1963","unstructured":"R.B. Wilson, \u201cA simplicial algorithm for concave programming,\u201d Dissertation, Garduate School of Business Administration, Harvard University (Boston, MA, 1963)."},{"key":"BF02591962_CR41","doi-asserted-by":"crossref","first-page":"382","DOI":"10.2307\/1909468","volume":"27","author":"P. Wolfe","year":"1959","unstructured":"P. Wolfe, \u201cThe simplex method for quadratic programming,\u201dEconometrica 27 (1959) 382\u2013398.","journal-title":"Econometrica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591962.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591962\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T08:14:36Z","timestamp":1736928876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["BF02591962"],"URL":"https:\/\/doi.org\/10.1007\/bf02591962","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}