Computing the nearest diagonally dominant matrix
Authors:
- 1 November 1998
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 5 (6) , 461-474
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite FactorizationSIAM Journal on Matrix Analysis and Applications, 1998
- Dykstra's Algorithm for a Constrained Least-squares Matrix ProblemNumerical Linear Algebra with Applications, 1996
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral caseNumerical Functional Analysis and Optimization, 1994
- The Method of Alternating Orthogonal Projections1992
- Positive Semidefinite Matrices: Characterization via Conical Hulls and Least-Squares Solution of a Matrix EquationSIAM Journal on Control and Optimization, 1988
- An Algorithm for Restricted Least Squares RegressionJournal of the American Statistical Association, 1983
- Theory of conesLinear Algebra and its Applications, 1981
- Cones of diagonally dominant matricesPacific Journal of Mathematics, 1975
- The structure of cones of matricesLinear Algebra and its Applications, 1975
- Proximity maps for convex setsProceedings of the American Mathematical Society, 1959