There is no variational characterization of the cycles in the method of periodic projections
From MaRDI portal
Publication:652441
DOI10.1016/j.jfa.2011.09.002zbMath1241.46015arXiv1102.1378OpenAlexW1976095572MaRDI QIDQ652441
Patrick L. Combettes, Roberto Cominetti, Jean-Bernard Baillon
Publication date: 14 December 2011
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1378
Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Existence theories for problems in abstract spaces (49J27) Equations and inequalities involving nonlinear operators (47J99)
Related Items
Monotone operator theory in convex optimization ⋮ The difference vectors for convex sets and a resolution of the geometry conjecture ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ Ubiquitous algorithms in convex optimization generate self-contracted sequences ⋮ Deep neural network structures solving variational inequalities ⋮ Asymptotic behavior of a periodic sequence of nonexpansive mappings with applications ⋮ A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections ⋮ Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem ⋮ Asymptotic behavior of compositions of under-relaxed nonexpansive operators ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Attouch--Théra Duality, Generalized Cycles, and Gap Vectors ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Cites Work
- Closed Fejer cycles for inconsistent systems of convex inequalities
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
- An alternating projection that does not converge in norm
- On rings of operators. Reduction theory
- Proximity Maps for Convex Sets
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- The method of projections for finding the common point of convex sets
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
