A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections

DOI10.1080/02331934.2018.1474471MaRDI QIDQ4613982zbMATH OpenOpenAlexWikidataFDO

Authors Vera Roshchina, Andrew Williamson, Roberto Cominetti

Publication date 28 January 2019

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.03216, http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/168080

zbMATH Keywords

cyclic projectionsDe Pierro conjectureunder-relaxed projections

Mathematics Subject Classification ID

Convex programming (90C25)

Abstract: The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to search for a point that minimizes the sum of the squared distances to the sets. In 2001, de Pierro conjectured that the limit cycles generated by the $varepsilon$-under-relaxed cyclic projection method converge when $varepsilondownarrow0$ towards a least squares solution. While the conjecture has been confirmed under fairly general conditions, we show that it is false in general by constructing a system of three compact convex sets in $mathbb{R}^3$ for which the $varepsilon$-under-relaxed cycles do not converge.

Recommendations

• Block-Iterative Algorithms with Underrelaxed Bregman Projections
• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• The method of alternating relaxed projections for two nonconvex sets
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• Cyclic projection methods on a class of nonconvex sets

Cites work

• scientific article; zbMATH DE number 3595777 (Why is no real title available?)
• scientific article; zbMATH DE number 2182575 (Why is no real title available?)
• Asymptotic behavior of compositions of under-relaxed nonexpansive operators
• From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
• On rings of operators. Reduction theory
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• The method of projections for finding the common point of convex sets
• There is no variational characterization of the cycles in the method of periodic projections

Cited in

(3)

• The difference vectors for convex sets and a resolution of the geometry conjecture
• Comparing averaged relaxed cutters and projection methods: theory and examples
• An open question on cyclic relaxation

This page was built for publication: A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections

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