{"title":"Convergence of proximal splitting algorithms in \\(\\operatorname{CAT}(\\kappa)\\) spaces and beyond","authors":"Lauster, Florian, Luke, D. Russell","doi":"10.1186/s13663-021-00698-0","DOIUrl":null,"url":null,"abstract":"In the setting of $\\operatorname{CAT}(\\kappa)$ spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky–Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric subregularity. Linear metric subregularity is in any case necessary for linearly convergent fixed point sequences, so the result is tight. To show this, we develop a theory of fixed point mappings that violate the usual assumptions of nonexpansiveness and firm nonexpansiveness in p-uniformly convex spaces.","PeriodicalId":12293,"journal":{"name":"Fixed Point Theory and Applications","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fixed Point Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s13663-021-00698-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In the setting of $\operatorname{CAT}(\kappa)$ spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky–Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric subregularity. Linear metric subregularity is in any case necessary for linearly convergent fixed point sequences, so the result is tight. To show this, we develop a theory of fixed point mappings that violate the usual assumptions of nonexpansiveness and firm nonexpansiveness in p-uniformly convex spaces.
期刊介绍:
In a wide range of mathematical, computational, economical, modeling and engineering problems, the existence of a solution to a theoretical or real world problem is equivalent to the existence of a fixed point for a suitable map or operator. Fixed points are therefore of paramount importance in many areas of mathematics, sciences and engineering.
The theory itself is a beautiful mixture of analysis (pure and applied), topology and geometry. Over the last 60 years or so, the theory of fixed points has been revealed as a very powerful and important tool in the study of nonlinear phenomena. In particular, fixed point techniques have been applied in such diverse fields as biology, chemistry, physics, engineering, game theory and economics.
In numerous cases finding the exact solution is not possible; hence it is necessary to develop appropriate algorithms to approximate the requested result. This is strongly related to control and optimization problems arising in the different sciences and in engineering problems. Many situations in the study of nonlinear equations, calculus of variations, partial differential equations, optimal control and inverse problems can be formulated in terms of fixed point problems or optimization.