A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables

Mathematics of Computation

Volumn 63, Issue 208, 1994, Pages 625-643

  Portugal, Luís F ^a   Júdice, Joaquim J ^a   Vicente, Luls N ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968502344     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1994-1250776-4     Document Type: Article

References (18)

1. M. Bierlair, P. Toint, and D. Tuyttens, On iterative algorithms for linear least-squares problems with bound constraints, Linear Algebra Appl. 143 (1991), 111-143.
2. A. Bjorck, A direct method for sparse least-squares problems with lower and upper bounds, Numer. Math. 54 (1988), 19-32.
3. A. Bjorck, Algorithms for linear least-squares problems, Computer Algorithms for Solving Linear Algebraic Equations (E. Spedicato, ed.), NATO Adv. Sci. Inst. Ser. F: Comput. and Systems Sci., vol. 77, Springer, Berlin and New York, 1992, pp. 57-92.
4. J. Carpenter, I. Lustig, J. Mulvey, and D. Shanno, Higher order predictor-corrector interior point methods with applications to quadratic objectives, Tech. Report Rutcor Research Report #67.90, 1990.
5. A. Cline, C. Moler, G. Stewart, and J. Wilkinson, An estimate for the condition number of a matrix, SIAM J. Numer. Anal. 16 (1979), 368-675.
6. I. Duff, R. Grimes, and J. Lewis, Sparse matrix test problems, ACM Trans. Math. Software 15 (1989), 1-14.
7. A. George and M. Heath, Solution of sparse linear least-squares problems using Givens rotations, Linear Algebra Appl. 34 (1980), 69-83.
8. A. George and J. Liu, Computer solution of large sparse symmetric positive definite systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
9. J. Judice and F. Pires, Bard-type methods for the linear complementarity problem with symmetric positive definite matrices, IMA J. Appl. Math. 2 (1988/89), 23-56.
10. J. Judice and F. Pires, Direct methods for convex quadratic programs subject to box constraints, Investigagao Operacional 9 (1989), 51-68.
11. J. Judice and F. Pires, Solution of large-scale strictly convex linear complementarity problems, Investigagao Operacional 11 (1991), 31-51.
12. M. Kostreva, Block pivot methods for solving the complementarity problem, Linear Algebra Appl. 21 (1978), 207-215.
13. C. Lawson and R. Hanson, Solving least-squares problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
14. I. Lustig, R. Marsten, and D. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl. 152 (1991), 191-222.
15. S. Mehrotra, On the implementation of a (primal-dual) interior point method, Tech. Report 03, Department of Civil Engineering and Management Sciences, Northwestern University, Evanston, IL, 1990.
16. K. Murty, Note on a Bard-type scheme for solving the complementarity problem, Oper. Res. 11 (1974), 123-130.
17. P. Pardalos, Y. Ye, and C. Han, An interior point algorithm for large-scale quadratic problems subject to box constraints, Lecture Notes in Control and Inform. Sci., vol. 144, Springer, Berlin and New York, 1990, pp. 413-422.
18. L. Portugal, Solution of least-squares problems, Master’s thesis, Faculdade de Ciencias e Tecnologia Universidade de Coimbra, 1992. (Portuguese)