Selective alternating projections to find the nearest SDD^+ matrix
From MaRDI portal
Publication:1412439
alternating projection methodDiagonally dominant matricesDykstra's algorithmMoreau's theoremnumerical experimentsPolyhedral cones
Recommendations
- Alternating projection method for the matrix pencil nearness problem
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Alternating projections, remotest projections, and greedy approximation
- The alternating projection method for solving structured low rank approximation
- Determinant-preserving sparsification of SDDM matrices
- scientific article; zbMATH DE number 2148414
- Stochastic alternating projections
- Improved spectral sparsification and numerical algorithms for SDD matrices
- Another note on the von Neumann alternating projections algorithm
- Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
Cites work
- An Algorithm for Restricted Least Squares Regression
- Computing the nearest diagonally dominant matrix
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- Primal and polar approach for computing the symmetric diagonally dominant projection
Cited in
(5)- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- Computing the nearest diagonally dominant matrix
- Decomposition methods for sparse matrix nearness problems
- Alternating projection method for sparse model updating problems
- Primal and polar approach for computing the symmetric diagonally dominant projection
This page was built for publication: Selective alternating projections to find the nearest SDD\(^{+}\) matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412439)
