Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
From MaRDI portal
Publication:2570742
DOI10.1016/j.amc.2004.06.136zbMath1082.65022MaRDI QIDQ2570742
Publication date: 28 October 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.136
numerical experiments; polyhedral cones; alternating projection methods; Dykstra's algorithm; cut cone
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
52B70: Polyhedral manifolds
Related Items
Cites Work
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix
- Proximity Maps for Convex Sets
- An Algorithm for Restricted Least Squares Regression
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Primal and polar approach for computing the symmetric diagonally dominant projection
- Geometry of cuts and metrics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item