How Averaged is the Composition of Two Linear Projections?

DOI10.1080/01630563.2023.2270308arXiv2303.13738OpenAlexW4388008257MaRDI QIDQ6146952

Walaa M. Moursi, Heinz H. Bauschke, Theo Bendit

Publication date: 15 January 2024

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonexpansive mappingprojectionFriedrichs angleaveraged mappingmodulus of averagednessOgura-Yamada bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Cites Work

• Unnamed Item
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
• Analysis and Linear Algebra: The Singular Value Decomposition and Applications
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: How Averaged is the Composition of Two Linear Projections?