Complete orthogonal decomposition for weighted least squares

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 2, 1997, Pages 369-392

  Hough, Patricia D ^a   Vavasis, Stephen A ^b  

^a Department of Obstetrics Gynecology   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Equilibrium systems; Forward error analysis; Interior point methods; Numerical stability; QR factorization; Weighted least squares

Indexed keywords

EID: 0031515615     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547989528079X     Document Type: Article

References (32)

1. J. L. BARLOW, Stability analysis of the G-algorithm and a note on its application to sparse least squares problems, BIT, 25 (1985), pp. 507-520.
2. A. BJÖRCK AND I. S. DUFF, A direct method for the solution of sparse linear least squares problems, Linear Algebra Appl., 34 (1980), pp. 43-67.
3. L. O. CHUA, C. A. DESOER, AND E. S. KUH, Linear and Nonlinear Circuits, McGraw-Hill, New York, 1987.
4. T. F. COLEMAN AND J. LIU, An Interior Newton Method for Quadratic Programming, Tech. report CTC93TR153, Advanced Computing Research Institute, Cornell University, Ithaca, NY, 1993.
5. A. L. FORSGREN, On Linear Least-Squares Problems with Diagonally Dominant Weight Matrices, Report TRITA-MAT-1995-OS2, Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1995.
6. A. FORSGREN, P. E. GILL, AND J. R. SHINNERL, Stability of symmetric ill-conditioned systems arising in interior methods for constrained optimization, SIAM J Matrix Anal. Appl., 17 (1996), pp. 187-211.
7. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, London, 1981.
8. P. E. GILL, M. A. SAUNDERS, AND J. R. SHINNERL, On the stability of Cholesky factorization for symmetric quasidefinite systems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 35-46.
9. G. GOLUB, Numerical methods for solving linear least squares problems, Numer. Math., 7 (1965), pp. 206-216.
10. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd Edition, The Johns Hopkins University Press, Baltimore, MD, 1989.
11. C. C. GONZAGA, Path-following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
12. N. GOULD, On the accurate determination of search directions for simple differentiable penalty functions, IMA J. Numer. Anal., 6 (1986), pp. 357-372.
13. M. GULLIKSSON, Backward error analysis for the constrained and weighted linear least squares problem when using the weighted QR factorization, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 675-687.
14. M. GULLIKSSON AND P. A. WEDIN, Modifying the QR decomposition to constrained and weighted linear least squares, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1298-1313.
15. N. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
16. P. D. HOUGH, Stable and Efficient Solution of Weighted Least-Squares Problems with Applications in Interior Point Methods, Ph.D. thesis, Cornell University, Ithaca, NY, 1996.
17. W. MURRAY, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, J. Optim. Theory Appl., 7 (1971), pp. 189-196.
18. S. G. NASH AND A. SOFER, A barrier method for large-scale constrained optimization, ORSA J. Comput., 5 (1993), pp. 40-53.
19. D. P. O'LEARY, On bounds for scaled projections and pseudoinverses, Linear Algebra Appl., 132 (1990), pp. 115-117.
20. C. C. PAIGE, Fast numerically stable computations for generalized least squares problems, SIAM J. Numer. Anal., 16 (1979), pp. 165-171.
21. G. PETERS AND J. H. WILKINSON, The least squares problem and pseudo-inverses, Comput. J., 13 (1970), pp. 309-316.
22. M. J. D. POWELL AND J. K. REID, On applying Householder transformations to linear least squares problems, in Proc. IFIP Congress, 1968, North-Holland, Amsterdam, 1969, pp. 122-126
23. G. W. STEWART, On scaled projections and pseudoinverses, Linear Algebra Appl., 112 (1989), pp. 189-193.
24. G. STRANG, A framework for equilibrium equations, SIAM Rev., 30 (1988), pp. 283-297.
25. M. J. TODD, A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm, Oper. Res., 38 (1990), pp. 1006-1018.
26. C. F. VAN LOAN, On the method of weighting for equality-constrained least-squares problems, SIAM J. Numer. Anal., 22 (1985), pp. 851-864.
27. S. A. VAVASIS, Stable finite elements for problems with wild coefficients, SIAM J. Numer. Anal., 33 (1996), pp. 890-916.
28. S. A. VAVASIS, Stable numerical algorithms for equilibrium systems, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1108-1131.
29. M. H. WRIGHT, Determining Subspace Information from the Hessian of a Barrier Function, Tech. report 92-02, AT&T Bell Laboratories Numerical Analysis manuscript, 1992.
30. S. J. WRIGHT, Stability of Linear Algebra Computations in Interior-Point Methods for Linear Programming, Tech. report MCS-P446-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1994.
31. S. J. WRIGHT, Primal-dual Interior-point Methods, SIAM, 1997, to appear.
32. Y. ZHANG, Solving Large-scale Linear Programs by Interior-Point Methods under the MATLAB Environment, Tech. report TR96-01, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD, 1996.