{"title":"两个线性投影的合成有多平均?","authors":"Heinz H. Bauschke, Theo Bendit, Walaa M. Moursi","doi":"10.1080/01630563.2023.2270308","DOIUrl":null,"url":null,"abstract":"AbstractProjection 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.KEYWORDS: Averaged mappingFriedrichs anglemodulus of averagednessnonexpansive mappingOgura–Yamada boundprojectionMATHEMATICS SUBJECT CLASSIFICATION: Primary: 47H09Secondary: 65K0590C25 AcknowledgmentsThe authors thank the reviewers and the editors for careful reading and constructive comments. We also thank Dr. Andrzej Cegielski for making us aware of his recent work [Citation3] which contains complementary results.Notes1 Usually, one excludes the cases κ = 0 and κ = 1 in the study of averaged operators, but it is very convenient in this paper to allow for this case.2 We assume for convenience throughout the paper that the operators have full domain which is the case in all algorithmic applications we are aware of. One could obviously generalize this notion to allow for operators whose domains are proper subsets of X.Additional informationFundingThe research of the authors was partially supported by Discovery Grants of the Natural Sciences and Engineering Research Council of Canada.","PeriodicalId":54707,"journal":{"name":"Numerical Functional Analysis and Optimization","volume":"67 5","pages":"0"},"PeriodicalIF":1.4000,"publicationDate":"2023-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"How Averaged is the Composition of Two Linear Projections?\",\"authors\":\"Heinz H. Bauschke, Theo Bendit, Walaa M. Moursi\",\"doi\":\"10.1080/01630563.2023.2270308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AbstractProjection 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.KEYWORDS: Averaged mappingFriedrichs anglemodulus of averagednessnonexpansive mappingOgura–Yamada boundprojectionMATHEMATICS SUBJECT CLASSIFICATION: Primary: 47H09Secondary: 65K0590C25 AcknowledgmentsThe authors thank the reviewers and the editors for careful reading and constructive comments. We also thank Dr. Andrzej Cegielski for making us aware of his recent work [Citation3] which contains complementary results.Notes1 Usually, one excludes the cases κ = 0 and κ = 1 in the study of averaged operators, but it is very convenient in this paper to allow for this case.2 We assume for convenience throughout the paper that the operators have full domain which is the case in all algorithmic applications we are aware of. One could obviously generalize this notion to allow for operators whose domains are proper subsets of X.Additional informationFundingThe research of the authors was partially supported by Discovery Grants of the Natural Sciences and Engineering Research Council of Canada.\",\"PeriodicalId\":54707,\"journal\":{\"name\":\"Numerical Functional Analysis and Optimization\",\"volume\":\"67 5\",\"pages\":\"0\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2023-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Functional Analysis and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/01630563.2023.2270308\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Functional Analysis and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01630563.2023.2270308","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
How Averaged is the Composition of Two Linear Projections?
AbstractProjection 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.KEYWORDS: Averaged mappingFriedrichs anglemodulus of averagednessnonexpansive mappingOgura–Yamada boundprojectionMATHEMATICS SUBJECT CLASSIFICATION: Primary: 47H09Secondary: 65K0590C25 AcknowledgmentsThe authors thank the reviewers and the editors for careful reading and constructive comments. We also thank Dr. Andrzej Cegielski for making us aware of his recent work [Citation3] which contains complementary results.Notes1 Usually, one excludes the cases κ = 0 and κ = 1 in the study of averaged operators, but it is very convenient in this paper to allow for this case.2 We assume for convenience throughout the paper that the operators have full domain which is the case in all algorithmic applications we are aware of. One could obviously generalize this notion to allow for operators whose domains are proper subsets of X.Additional informationFundingThe research of the authors was partially supported by Discovery Grants of the Natural Sciences and Engineering Research Council of Canada.
期刊介绍:
Numerical Functional Analysis and Optimization is a journal aimed at development and applications of functional analysis and operator-theoretic methods in numerical analysis, optimization and approximation theory, control theory, signal and image processing, inverse and ill-posed problems, applied and computational harmonic analysis, operator equations, and nonlinear functional analysis. Not all high-quality papers within the union of these fields are within the scope of NFAO. Generalizations and abstractions that significantly advance their fields and reinforce the concrete by providing new insight and important results for problems arising from applications are welcome. On the other hand, technical generalizations for their own sake with window dressing about applications, or variants of known results and algorithms, are not suitable for this journal.
Numerical Functional Analysis and Optimization publishes about 70 papers per year. It is our current policy to limit consideration to one submitted paper by any author/co-author per two consecutive years. Exception will be made for seminal papers.