Primal and polar approach for computing the symmetric diagonally dominant projection

DOI10.1002/NLA.277MaRDI QIDQ5317849zbMATH OpenOpenAlexFDO

Authors M. Raydan, Pablo Tarazaga

Publication date 21 September 2005

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.277

zbMATH Keywords

diagonally dominant matricespolyhedral conesDykstra's algorithmKuhn-Tucker conditionsMoreau's theorem

Mathematics Subject Classification ID

Recommendations

• Selective alternating projections to find the nearest SDD\(^{+}\) matrix
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
• Computing the nearest diagonally dominant matrix
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
• A fixed-point method for approximate projection onto the positive semidefinite cone

Cites work

• Cones of diagonally dominant matrices

Cited in

(7)

• Computational acceleration of projection algorithms for the linear best approximation problem
• Selective alternating projections to find the nearest SDD\(^{+}\) matrix
• A fixed-point method for approximate projection onto the positive semidefinite cone
• Computing the nearest diagonally dominant matrix
• Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
• An acceleration scheme for Dykstra's algorithm
• On the inexact scaled gradient projection method

This page was built for publication: Primal and polar approach for computing the symmetric diagonally dominant projection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317849)