Necessary conditions for linear convergence of iterated expansive, set-valued mappings

被引:0
作者
D. Russell Luke
Marc Teboulle
Nguyen H. Thao
机构
[1] Universität Göttingen,Institut für Numerische und Angewandte Mathematik
[2] Tel Aviv University,School of Mathematical Sciences
[3] Delft University of Technology,Delft Center for Systems and Control
[4] Cantho University,Department of Mathematics, Teacher College
来源
Mathematical Programming | 2020年 / 180卷
关键词
Almost averaged mappings; Averaged operators; Calmness; Cyclic projections; Elemental regularity; Feasibility; Fejér monotone; Fixed points; Fixed point iteration; Metric regularity; Metric subregularity; Nonconvex; Nonexpansive; Subtransversality; Transversality; Primary 49J53; 65K10; Secondary 49K40; 49M05; 49M27; 65K05; 90C26;
D O I
暂无
中图分类号
学科分类号
摘要
We present necessary conditions for monotonicity of fixed point iterations of mappings that may violate the usual nonexpansive property. Notions of linear-type monotonicity of fixed point sequences—weaker than Fejér monotonicity—are shown to imply metric subregularity. This, together with the almost averaging property recently introduced by Luke et al. (Math Oper Res, 2018. https://doi.org/10.1287/moor.2017.0898), guarantees linear convergence of the sequence to a fixed point. We specialize these results to the alternating projections iteration where the metric subregularity property takes on a distinct geometric characterization of sets at points of intersection called subtransversality. Subtransversality is shown to be necessary for linear convergence of alternating projections for consistent feasibility.
引用
收藏
页码:1 / 31
页数:30
相关论文
共 58 条
[1]  
Aragón Artacho FJ(2011)Enhanced metric regularity and Lipschitzian properties of variational systems J. Glob. Optim. 50 145-167
[2]  
Mordukhovich BS(2016)Local linear convergence of the ADMM/Douglas–Rachford algorithms without strong convexity and application to statistical imaging SIAM J. Imaging Sci. 9 842-868
[3]  
Aspelmeier T(1993)On the convergence of von Neumann’s alternating projection algorithm for two sets Set-Valued Anal. 1 185-212
[4]  
Charitha C(1996)On projection algorithms for solving convex feasibility problems SIAM Rev. 38 367-426
[5]  
Luke DR(2013)Restricted normal cones and the method of alternating projections: applications Set-Valued Var. Anal. 21 475-501
[6]  
Bauschke HH(2013)Restricted normal cones and the method of alternating projections: theory Set-Valued Var. Anal. 21 431-473
[7]  
Borwein JM(2010)Characterizations of Łojasiewicz inequalities: subgradient flows, talweg, convexity Trans. Am. Math. Soc. 362 3319-3363
[8]  
Bauschke HH(2015)Transversality and alternating projections for nonconvex sets Found. Comput. Math. 15 1637-1651
[9]  
Borwein JM(2013)Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems SIAM J. Optim. 23 2397-2419
[10]  
Bauschke HH(1989)Approximate subdifferentials and applications: III Mathematika 36 1-38