BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-69-134
       ENTRY:: November 27, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Linear least squares and quadratic programming
        TYPE:: Technical Report
      AUTHOR:: Golub, Gene H.
      AUTHOR:: Saunders, Michael A.
        DATE:: May 1969
       PAGES:: 38
    ABSTRACT:: Several algorithms are presented for solving linear least
               squares problems; the basic tool is orthogonalization
               techniques. A highly accurate algorithm is presented for
               solving least squares problems with linear inequality
               constraints. A method is also given for finding the least
               squares solution when there is a quadratic constraint on the
               solution.
       NOTES:: [Adminitrivia V1/Prg/19951127]
         END:: STAN//CS-TR-69-134