{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:44Z","timestamp":1759847804345},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":[[1986,10]]},"DOI":"10.1007\/bf02591992","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:35:01Z","timestamp":1175182501000},"page":"90-104","source":"Crossref","is-referenced-by-count":43,"title":["Convex quadratic programming with one constraint and bounded variables"],"prefix":"10.1007","volume":"36","author":[{"given":"Jean-Pierre","family":"Dussault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Lemaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591992_CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"D. Bertsekas","year":"1976","unstructured":"D. Bertsekas, \u201cOn the Goldstein-Levitin-Polyak gradient projection method,\u201dIEEE Transaction on Automatic Control AC-21 (1976) 174\u2013184.","journal-title":"IEEE Transaction on Automatic Control AC"},{"key":"BF02591992_CR2","volume-title":"Introduction \u00e0 l\u2019analyse num\u00e9rique matricielle et \u00e0 l\u2019optimisation","author":"P.G. Ciarlet","year":"1982","unstructured":"P.G. Ciarlet,Introduction \u00e0 l\u2019analyse num\u00e9rique matricielle et \u00e0 l\u2019optimisation (Masson, Paris, France, 1982)."},{"key":"BF02591992_CR3","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BF01584990","volume":"3","author":"R.W. Cottle","year":"1972","unstructured":"R.W. Cottle, \u201cMonotone solutions of the parametric linear complementarity problem,\u201dMathematical Programming 3 (1972) 210\u2013224.","journal-title":"Mathematical Programming"},{"key":"BF02591992_CR4","volume-title":"Solution num\u00e9rique de mod\u00e8les d\u2019\u00e9quilibre","author":"J.P. Dussault","year":"1982","unstructured":"J.P. Dussault, \u201cSolution num\u00e9rique de mod\u00e8les d\u2019\u00e9quilibre,\u201d Th\u00e8se de doctorat, Universit\u00e9 de Montr\u00e9al (Montr\u00e9al, Canada, 1982)."},{"key":"BF02591992_CR5","series-title":"Publication","volume-title":"Analytic solutions for non-linear programs with one or two equality constraints","author":"J.A. Ferland","year":"1978","unstructured":"J.A. Ferland, B. Lemaire and P. Robert, \u201cAnalytic solutions for non-linear programs with one or two equality constraints,\u201d Publication #285, D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al (Montr\u00e9al, Canada, 1978)."},{"key":"BF02591992_CR6","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"A.A. Goldstein","year":"1964","unstructured":"A.A. Goldstein, \u201cConvex programming in Hilbert space\u201dBulletin American Mathematical Society 70 (1964) 709\u2013710.","journal-title":"Bulletin American Mathematical Society"},{"key":"BF02591992_CR7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01588328","volume":"18","author":"R. Helgason","year":"1980","unstructured":"R. Helgason, J. Kennington and H. Lall, \u201cA polynomially bounded algorithm for a singly constrained quadratic program,\u201dMathematical Programming 18 (1980) 338\u2013343.","journal-title":"Mathematical Programming"},{"key":"BF02591992_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E.S. Levitin","year":"1966","unstructured":"E.S. Levitin and B.T. Polyak, \u201cConstrained minimization problems,\u201dUSSR Computational Mathematics and Mathematical Physics 6 (1966) 1\u201350.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"BF02591992_CR9","series-title":"Technical Report SOL","volume-title":"Minimization with one linear equality constraint and bounds on the variables","author":"R.K. McCord","year":"1979","unstructured":"R.K. McCord, \u201cMinimization with one linear equality constraint and bounds on the variables,\u201d Technical Report SOL 79-20, System Optimization Laboratory, Dept. Operations Research, Stanford University, (Stanford, CA, 1979)."},{"key":"BF02591992_CR10","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/opre.28.3.754","volume":"28","author":"J.S. Pang","year":"1980","unstructured":"J.S. Pang, \u201cA new and efficient algorithm for a class of portfolio selection problems,\u201dOperations Research 28 (1980) 754\u2013767.","journal-title":"Operations Research"},{"key":"BF02591992_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton N.J., 1970)."},{"key":"BF02591992_CR12","volume-title":"R\u00e9solution num\u00e9rique de probl\u00e8mes d\u2019optimisation \u00e0 une seule contrainte lin\u00e9aire. Application au probl\u00e8me de Thomas-Fermi","author":"M.C. Trevisan","year":"1980","unstructured":"M.C. Trevisan, \u201cR\u00e9solution num\u00e9rique de probl\u00e8mes d\u2019optimisation \u00e0 une seule contrainte lin\u00e9aire. Application au probl\u00e8me de Thomas-Fermi,\u201d Th\u00e8se de 3i\u00e8me cycle, Universit\u00e9 des Sciences et Techniques du Languedoc (Montpellier, France, 1980)."},{"key":"BF02591992_CR13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P. Wolfe","year":"1976","unstructured":"P. Wolfe, \u201cFinding the nearest point in a polytope,\u201dMathematical Programming 11 (1976) 128\u2013149.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591992.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591992\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:51Z","timestamp":1558395471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["BF02591992"],"URL":"https:\/\/doi.org\/10.1007\/bf02591992","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}