Computing the Nearest Diagonally Dominant Matrix

Numerical Linear Algebra with Applications

Volumn 5, Issue 6, 1998, Pages 461-474

  Mendoza, María ^a   Raydan, Marcos ^a   Tarazaga, Pablo ^b  

^a FACULTAD DE CIENCIAS   (Venezuela)

^b UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

Diagonally dominant matrices; Dykstra's algorithm; Kuhn Tucker conditions; Matrix cones

Indexed keywords

EID: 0032244218     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199811/12)5:6<461::AID-NLA141>3.0.CO;2-V     Document Type: Article

References (30)

1. J. C. Allwright. Positive semidefinite matrices: characterization via conical hulls and least-squares solution of a matrix equation. SIAM J. Control and Optimization, 26, 537-555, 1988.
2. M. Avriel. Nonlinear Programming: Analysis and Methods. Prentice-Hall, New Jersey, 1976.
3. G. P. Barker. Theory of cones. Linear Algebra and Applications, 39, 263-291, 1981.
4. G. P. Barker and D. Carlson. Cones of diagonally dominant matrices. Pacific J. Math., 57, 15-32, 1975.
5. G. P. Barker and R. Loewy. The structure of cones of matrices. Linear Algebra and Applications, 12, 87-94, 1975.
6. J. P. Boyle and R. L. Dykstra. A method for finding projections onto the intersections of convex sets in Hilbert spaces, volume 37. Springer-Verlag, 1986.
7. W. Cheney and A. Goldstein. Proximity maps for convex sets. Proc. Amer. Math. Soc., 10, 448-450, 1959.
8. S. H. Cheng and N. J. Higham. A modified Cholesky algorithm based on a symmetric indefinite factorization. Technical Report No. 289, Manchester Centre for Computational Mathematics, Manchester, England, 1996. SIAM J. Matrix Anal. Appl., 19, 1097-1110, 1998.
9. G. B. Dantzig. Deriving an utility function for the economy. Technical Report SOL 85-6R, Department of Operations Research, Stanford University, Stanford, CA, 1985.
10. F. Deutsch. The method of alternating orthogonal projections. In S.P. Singh, editor, Approximation Theory, Spline Functions and Applications, pages 105-121. Kluwer Academic Publishers, Netherlands, 1992.
11. F. Deutsch and H. Hundal. The rate of convergence of Dykstra's cyclic projections algorithm: the polyhedral case. Numer. Funct. Anal. Optimiz., 15, 537-565, 1994.
12. R. L. Dykstra. An algorithm for restricted least-squares regression. J. Amer. Stat. Assoc., 78, 837-842, 1983.
13. R. Escalante and M. Raydan. Dykstra's algorithm for a constrained least-squares matrix problem. Numerical Linear Algebra with Applications, 3, 459-471, 1996.
14. R. Escalante and M. Raydan. On Dykstra's algorithm for constrained least-squares rectangular matrix problems. Computers and Mathematics with Applications, 35, 73-79, 1998.
15. M. Fiedler and V. Ptak. Diagonally dominant matrices. Czech. Math. J., 17(92), 420-433, 1967.
16. R. Fletcher. A nonlinear programming problem in statistics (educational testing). SIAM J. Sci. Stat. Comp., 2, 257-267, 1981.
17. R. Fletcher. Semi-definite matrix constraints in optimization. SIAM J. Control and Opt., 23, 493-513, 1985.
18. N. Gaffke and R. Mathar. A cyclic projection algorithm via duality. Metrika, 36, 29-54, 1989.
19. T. L. Hayden and J. Wells. Approximation by matrices positive semidefinite on a subspace. Linear Algebra and Applications, 109, 115-130, 1988.
20. N. J. Higham. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra and Applications, 103, 103-118, 1988.
21. R. D. Hill and S. R. Waters. On the cone of positive semidefinite matrices. Linear Algebra and Applications, 90, 81-88, 1987.
22. H. Hu. Positive definite constrained least-squares estimation of matrices. Linear Algebra and Applications, 229, 167-174, 1995.
23. H. Hu and I. Olkin. A numerical procedure for finding the positive definite matrix closest to a patterned matrix. Statistics and Probability Letters, 12, 511-515, 1991.
24. M. Mendoza. Proyección sobre el conjunto de las matrices simétricas diagonal dominantes, 1996. Master Thesis, Departamento de Computacion, Universidad Central de Venezuela, Caracas, Venezuela.
25. J. von Neumann. Functional operators vol. II. The geometry of orthogonal spaces. Annals of Math. Studies, 22, 1950. Princeton University Press. This is a reprint of mineographed lecture notes first distributed in 1933.
26. W. Murray P. E. Gill and M. H. Wright. Practical Optimization. Academic Press, London, 1981.
27. R. B. Schnabel and E. Eskow. A new modified Cholesky factorization. SIAM J. Sci. Stat. Comput., 11, 1136-1158, 1990.
28. R. Sedgewick. Algorithms in C. Adisson Wesley, London, 1990.
29. J. M. Varah. A lower bound for the smallest singular value of a matrix. Linear Algebra and Applications, 11, 3-5, 1975.
30. S. Hong W. Glunt, T. L. Hayden and J. Wells. An alternating projection algorithm for computing the nearest euclidean distance matrix. SIAM J. Matrix Anal. Appl., 11, 589-600, 1990.