{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:46:21Z","timestamp":1778823981530,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf01584232","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:29:50Z","timestamp":1114676990000},"page":"98-118","source":"Crossref","is-referenced-by-count":117,"title":["An algorithm for linear least squares problems with equality and nonnegativity constraints"],"prefix":"10.1007","volume":"21","author":[{"given":"Karen H.","family":"Haskell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard J.","family":"Hanson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"FLECS\u2014Fortran Language with Extended Control Structures\u2014User's manual","author":"T. Beyer","year":"1974","unstructured":"T. Beyer, \u201cFLECS\u2014Fortran Language with Extended Control Structures\u2014User's manual\u201d, University of Oregon Computing Center, Eugene, OR (September 1974)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0714026","volume":"14","author":"C.W. Boor de","year":"1977","unstructured":"C.W. de Boor, \u201cPackage for calculating withB-splines\u201d,SIAM Journal on Numerical Analysis 14 (1977) 441\u2013442.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR3","unstructured":"A.K. Cline, \u201cThe transformation of a quadratic programming problem into solvable form\u201d, ICASE Rept. No. 75-14 (August 1975)."},{"key":"CR4","unstructured":"L. Eld\u00e9n, \u201cNumerical analysis of regularization and constrained least squares methods\u201d, Part V, Link\u00f6ping Studies in Science and Technology, Dissertations, No. 21, LiTH-MAT-R-1977-20 (1977)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imamat\/12.3.329","volume":"12","author":"M. Gentleman","year":"1973","unstructured":"M. Gentleman, \u201cLeast squares computations by Givens transformations without square roots\u201d,Journal of the Institute of Mathematics and its Applications 12 (1973) 329\u2013336.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"CR6","first-page":"229","volume-title":"Integer and nonlinear programming, II","author":"G.H. Golub","year":"1970","unstructured":"G.H. Golub and M.A. Saunders, \u201cLinear least squares and quadratic programming\u201d, in: J. Abadie, ed.,Integer and nonlinear programming, II (North-Holland, Amsterdam, 1970) pp. 229\u2013256."},{"key":"CR7","volume-title":"\u201cSelected algorithms for the linearly constrained least squares problem\u2014A user's guide\u201d, SAND78-1290","author":"K.H. Haskell","year":"1979","unstructured":"K.H. Haskell and R.J. Hanson, \u201cSelected algorithms for the linearly constrained least squares problem\u2014A user's guide\u201d, SAND78-1290, Sandia Laboratories, Albuquerque, NM (1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"C.L. Lawson","year":"1979","unstructured":"C.L. Lawson, R.J. Hanson, D.R. Kincaid and F.T. Krogh, \u201cBasic linear algebra subprograms for Fortran usage\u201d,ACM Transactions on Mathematical Software 5 (1979) 308\u2013323.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR9","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, Englewood Cliffs, NJ, 1974)."},{"key":"CR10","first-page":"157","volume-title":"Lecture Notes in Mathematics, Vol. 506","author":"C.L. Lawson","year":"1976","unstructured":"C.L. Lawson, \u201cOn the discovery and description of mathematical programming algorithms\u201d, in: A. Dold and B. Eckmann, eds.,Lecture Notes in Mathematics, Vol. 506 (Springer, Berlin, 1976) pp. 157\u2013165."},{"key":"CR11","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\u201d,Mathematical Programming 16 (1979) 141\u2013158.","journal-title":"Mathematical Programming"},{"key":"CR12","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\u201d,Numerische Mathematik 31 (1979) 431\u2013463.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"CR13","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 (2) (1971) 382\u2013411.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR14","first-page":"56","volume-title":"An analysis of the finite element method","author":"G. Strang","year":"1973","unstructured":"G. Strang and G. Fix,An analysis of the finite element method (Prentice-Hall, Englewood Cliffs, NJ, 1973) p. 56."},{"key":"CR15","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\u201d,Mathematical 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\/BF01584232.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584232\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:28Z","timestamp":1556897368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01584232"],"URL":"https:\/\/doi.org\/10.1007\/bf01584232","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}