On the stability of the existence of fixed points for the projection-iterative methods with relaxation
Andrzej Komisarski, Adam Paszkiewicz

TL;DR
This paper characterizes the sets of relaxation parameters for which fixed points exist in compositions of relaxed projection operators in Hilbert spaces, revealing the topological complexity of these parameter sets.
Contribution
It provides a complete characterization of the parameter sets ensuring fixed points for compositions of relaxed projections in Hilbert spaces, especially for dimensions three and higher.
Findings
The fixed point existence depends on the relaxation parameter set F.
Sets F are exactly the F_sigma subsets of [0,1] containing 0 for certain dimensions and compositions.
The characterization applies to compositions with at least three operators in spaces of dimension three or more.
Abstract
We consider an -relaxed projection given by where and is the projection onto a non-empty, convex and closed subset of the real Hilbert space . We characterise all the sets such that for some non-empty, convex and closed subsets the composition has a fixed point iff . It proves, that if and then the class of the derscribed above sets of coefficients is exactly the class of subsets of containing .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Optimization Algorithms Research · Matrix Theory and Algorithms
