Solution of large-scale weighted least-squares problems

A sequence of least squares problems of the form miny kG1=2(AT y h)k2, where G is an n n positive definite diagonal weight matrix, and A anm n (m n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low-rank correction preconditioners for such problems, and a mixed solver (a combination of a direct solver and an iterative solver). The numerical results show that our technique for selecting the low-rank correction matrix is very effective. Copyright c 2000 John Wiley & Sons, Ltd.

[1]  Dianne P. O'Leary,et al.  Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming , 2000, Numerical Algorithms.

[2]  Venansius Baryamureeba.  On Solving Large-Scale Weighted Least Squares Problems , 2000, NAA.

[3]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[4]  A. Vannelli,et al.  An Efficient Linear Systems Approach For Finding Netlist Partitions , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[5]  Mauricio G. C. Resende,et al.  An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..

[6]  Knud D. Andersen.  A modified Schur-complement method for handling dense columns in interior-point methods for linear programming , 1996, TOMS.

[7]  Petri Juutinen,et al.  The ∞-Eigenvalue Problem , 1999 .

[8]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[9]  Timothy A. Davis,et al.  Modifying a Sparse Cholesky Factorization , 1999, SIAM J. Matrix Anal. Appl..

[10]  Trond Steihaug,et al.  Computational Issues for a New Class of Preconditioners , 1999, LSSC.

[11]  Anthony Vannelli.  An adaptation of the interior point method for solving the global routing problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Yin Zhang,et al.  Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .

[13]  Weichung Wang,et al.  Adaptive use of iterative methods in interior point methods for linear programming , 1995 .

[14]  Man-Tak Shing,et al.  A decomposition algorithm for circuit routing , 1985 .

[15]  Linda Kaufman,et al.  Cholesky factor updating techniques for rank 2 matrix modifications , 1989 .

[16]  Svetozar Margenov,et al.  Large-scale scientific computations of engineering and environmental problems II : Proceedings of the second workshop on "Large-Scale Scientific Computations" Sozopol, Bulgaria, June 2-6, 1999 , 2000 .

[17]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .