On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections

DOI10.1007/s11590-020-01600-4zbMath1464.90055arXiv2001.06747OpenAlexW3028126195MaRDI QIDQ2228383

Heinz H. Bauschke, Daniel B. Herman, Regina Sandra Burachik, C. Yalçın Kaya

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.06747

zbMATH Keywords

projectionconvex setDykstra's algorithmmethod of alternating projections

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

Convergence Rate Analysis of a Dykstra-Type Projection Algorithm ⋮ Finitely convergent iterative methods with overrelaxations revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Dykstra's alternating projection algorithm for two sets
• An alternating projection that does not converge in norm
• Necessary conditions for linear convergence of iterated expansive, set-valued mappings
• Projecting onto the Intersection of a Cone and a Sphere
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections