Chapter 6 Large sparse quadratic programs

Part of the Lecture Notes in Computer Science book series (LNCS, volume 165)


Sparse Matrix Feasible Point Cholesky Factor Space Method Matrix Augmentation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6.4 References

  1. Bisschop, J. and Meeraus, A. [1977]. Matrix Augmentation and partitioning in the updating of the basis inverse, Mathematical Programming 13, 241–254.Google Scholar
  2. Bisschop, J. and Meeraus, A. [1980]. Matrix augmentation and structure preservation in linearly constrained control problems, Mathematical Programming 18, 7–15.Google Scholar
  3. Fletcher[1981]. Practical Methods of Optimization: Constrained Optimization, John Wiley & Sons.Google Scholar
  4. Gill, Golub, Murray, and Saunders [1974]. Methods for modifying matrix factorizations, Math. of Computations 28, 505–535.Google Scholar
  5. Gill, Murray, and Wright [1981]. Practical Optimization, Academic Press.Google Scholar
  6. Gill, Murray, Wright and Saunders[1983]. Sparse matrix methods in optimization, SIAM Journal on Scientific and Statistical Computing, to appear.Google Scholar
  7. George, J.A. and Ng, E. [1983]. On row and column orderings for sparse least squares problems, SIAM Journal on Numerical Analysis, 20, 326–344.Google Scholar
  8. Lawson, C. and Hanson, R. [1974]. Solving Least Squares Problems, Prentice-Hall.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Personalised recommendations