There is no variational characterization of the cycles in the method of periodic projections

DOI10.1016/J.JFA.2011.09.002zbMATH Open1241.46015arXiv1102.1378OpenAlexW1976095572MaRDI QIDQ652441FDOQ652441

Authors: Patrick L. Combettes, J. B. Baillon, Roberto Cominetti 

Publication date: 14 December 2011

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Abstract: The method of periodic projections consists in iterating projections onto $m$ closed convex subsets of a Hilbert space according to a periodic sweeping strategy. In the presence of $mgeq3$ sets, a long-standing question going back to the 1960s is whether the limit cycles obtained by such a process can be characterized as the minimizers of a certain functional. In this paper we answer this question in the negative. Projection algorithms that minimize smooth convex functions over a product of convex sets are also discussed.

Full work available at URL: https://arxiv.org/abs/1102.1378

Recommendations

• A cyclic projection algorithm via duality
• An alternating projection that does not converge in norm
• On the convergence of von Neumann's alternating projection algorithm for two sets
• On cluster points of alternating projections
• On the unrestricted iteration of projections in Hilbert space

zbMATH Keywords

alternating projectionsbest approximationlimit cycleFroda's theoremvon Neumann algorithm

Mathematics Subject Classification ID

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)

Cites Work

• On rings of operators. Reduction theory
• Title not available (Why is that?)
• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On the convergence of von Neumann's alternating projection algorithm for two sets
• An alternating projection that does not converge in norm
• Title not available (Why is that?)
• The method of projections for finding the common point of convex sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Dykstra's alternating projection algorithm for two sets
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proximity Maps for Convex Sets
• Title not available (Why is that?)
• Closed Fejer cycles for inconsistent systems of convex inequalities
• On the random product of orthogonal projections in Hilbert space
• On the random product of orthogonal projections in Hilbert space. II

Cited In (15)

• 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
• Attouch--Théra Duality, Generalized Cycles, and Gap Vectors
• 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
• From error bounds to the complexity of first-order descent methods for convex functions
• Deep neural network structures solving variational inequalities
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• The difference vectors for convex sets and a resolution of the geometry conjecture
• Comparing averaged relaxed cutters and projection methods: theory and examples
• Asymptotic behavior of compositions of under-relaxed nonexpansive operators
• Ubiquitous algorithms in convex optimization generate self-contracted sequences
• Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem
• Can linear superiorization be useful for linear optimization problems?
• Monotone operator theory in convex optimization

This page was built for publication: There is no variational characterization of the cycles in the method of periodic projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652441)