This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6.4 References
Bisschop, J. and Meeraus, A. [1977]. Matrix Augmentation and partitioning in the updating of the basis inverse, Mathematical Programming 13, 241–254.
Bisschop, J. and Meeraus, A. [1980]. Matrix augmentation and structure preservation in linearly constrained control problems, Mathematical Programming 18, 7–15.
Fletcher[1981]. Practical Methods of Optimization: Constrained Optimization, John Wiley & Sons.
Gill, Golub, Murray, and Saunders [1974]. Methods for modifying matrix factorizations, Math. of Computations 28, 505–535.
Gill, Murray, and Wright [1981]. Practical Optimization, Academic Press.
Gill, Murray, Wright and Saunders[1983]. Sparse matrix methods in optimization, SIAM Journal on Scientific and Statistical Computing, to appear.
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.
Lawson, C. and Hanson, R. [1974]. Solving Least Squares Problems, Prentice-Hall.
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1984). Chapter 6 Large sparse quadratic programs. In: Coleman, T.F. (eds) Large Sparse Numerical Optimization. Lecture Notes in Computer Science, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12914-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-12914-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12914-1
Online ISBN: 978-3-540-38796-1
eBook Packages: Springer Book Archive