25
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm

, &
Pages 127-143 | Received 19 Jun 1984, Published online: 20 Mar 2007

References

  • Alvarez-Maldonado , O. “ Estudio de un cierto algoritmo de programación cuadrática ” . In Tesis M.en C
  • Berman , A. and Plemmons , R. Non-negative matrices in the mathematical sciences
  • Cottle , R. W. 1968 . “ The principal pivoting method of quadratic programming ” . In Mathematics of the Decision Sciences , Edited by: Dantzig , G. B. and Veinott , A. F. Jr . Vol. 1 , American Mathematical Soc .
  • Dantzig , G. B. and Cottle , R. W. 1963 . “ Posite semi-definite programming ” . In ORC 63-18 (RR), Operations Research Center , Berkeley : University of California .
  • Escobar , L. A. and Skarpness , B. 1984 . A closed form solution for the least squares regression problem with linear inequality constraints . Communications in Statistics, Theory and Method , 13 ( 9 ) : 1127 – 1134 .
  • Gomez , S. 1975 . “ Two complementary-pivot methods for solving the quadratic programming problem ” . In M.Sc.Thesis , University of London .
  • Goodnight , J. H. 1979 . A tutorial of the SWEEP operator . The American Statistician , 33 ( 3 )
  • Lemke , C. E. 1968 . “ Our complementary pivot theory ” . In Mathematics of the Decision Sciences , Edited by: Dantzig , G. B. and Veinott , A. F. RI : American Mathematical Soc., Providence . Part I
  • Liew , C. K. 1976 . Inequality constrained least-squares estimation . JASA , 71 ( 355 ) : 746 – 751 .
  • Marsaglia , A. and Bray , T. A. 1964 . A convenient method for generating normal variables . SIAM Rev , 6 ( 355 )
  • Quintana , J. M. 1981 . “ Un algoritmo para resolver problemas de programación cuadrática ” . In Tesis, M.en C , IIMAS-UNAM .
  • Ravindram , A. 1972 . A computer routine for quadratic and linear programming problems . Communications of the ACM , 15 ( 9 ) September
  • Sargent , R. W. H. 1978 . “ An efficient implementation of the lemke algorithm and its extension to deal with upper and lower bounds ” . In Mathematical Programming Study 7 , North-Holland Publishing .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.