How Averaged is the Composition of Two Linear Projections?

DOI10.1080/01630563.2023.2270308MaRDI QIDQ6146952zbMATH OpenOpenAlexFDO

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

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

averaged mappingFriedrichs anglemodulus of averagednessnonexpansive mappingOgura-Yamada boundprojection

Mathematics Subject Classification ID

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

Abstract: Projection operators are fundamental algorithmic operators in Analysis and Optimization. It is well known that these operators are firmly nonexpansive; however, their composition is generally only averaged and no longer firmly nonexpansive. In this note, we introduce the modulus of averagedness and provide an exact result for the composition of two linear projection operators. As a consequence, we deduce that the Ogura-Yamada bound for the modulus of the composition is sharp.

Cites work

• Analysis and Linear Algebra: The Singular Value Decomposition and Applications
• Best approximation in inner product spaces
• Convex analysis and monotone operator theory in Hilbert spaces
• scientific article; zbMATH DE number 878830 (Why is no real title available?)
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited in

(1)

• On a result by Baillon, Bruck, and Reich

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

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