scispace - formally typeset
Open AccessJournal ArticleDOI

On Local Convergence of the Method of Alternating Projections

Reads0
Chats0
TLDR
In this article, the authors proved local convergence of alternating projections between subanalytic sets under a mild regularity hypothesis on one of the sets, and showed that the speed of convergence is O(k √ √ σ(k − σ ) for some constant σ √ n, σ (n) for some σ σ = (0, √ N) √ (n − ρ) for any σ > 0.
Abstract
The method of alternating projections is a classical tool to solve feasibility problems. Here we prove local convergence of alternating projections between subanalytic sets $$A,B$$A,B under a mild regularity hypothesis on one of the sets. We show that the speed of convergence is $${\mathcal {O}}(k^{-\rho })$$O(k-?) for some $$\rho \in (0,\infty )$$??(0,?).

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Transversality and Alternating Projections for Nonconvex Sets

TL;DR: This work considers the method of alternating projections for finding a point in the intersection of two closed sets and proves local linear convergence and subsequence convergence when the two sets are semi-algebraic and bounded, but not necessarily transversal.
Journal ArticleDOI

Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections

TL;DR: In this paper, the authors show that with a suitable initialization procedure, the classical alternating projections (Gerchberg-Saxton) succeeds with high probability when $m\geq Cn$, for some $C>0$.
Posted Content

Phase retrieval with random Gaussian sensing vectors by alternating projections

TL;DR: It is conjecture that the classical algorithm of alternating projections (Gerchberg–Saxton) succeeds with high probability when no special initialization procedure is used, and it is conjectured that this result is still true when nospecial initialization process is used.
Journal ArticleDOI

Set regularities and feasibility problems

TL;DR: In this article, the authors synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems.
Journal ArticleDOI

Quantitative convergence analysis of iterated expansive, set-valued mappings

TL;DR: In this paper, the authors develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings, and prove local linear convergence of nonconvex cyclic projections for inconsistent (and consistent) feasibility problems.
References
More filters
Journal ArticleDOI

Phase retrieval algorithms: a comparison.

TL;DR: Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods and it is shown that both the error-reduction algorithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm forThe problem of two intensity measurements converge.
Journal Article

A practical algorithm for the determination of phase from image and diffraction plane pictures

R. W. Gerchberg
- 01 Jan 1972 - 
TL;DR: In this article, an algorithm is presented for the rapid solution of the phase of the complete wave function whose intensity in the diffraction and imaging planes of an imaging system are known.
Journal ArticleDOI

Splitting Algorithms for the Sum of Two Nonlinear Operators

TL;DR: This work studies two splitting algorithms for (stationary and evolution) problems involving the sum of two monotone operators with real-time requirements.
Journal ArticleDOI

Extending the methodology of X-ray crystallography to allow imaging of micrometre-sized non-crystalline specimens

TL;DR: Extending the methodology of X-ray crystallography to allow imaging of micrometre-sized non-crystalline specimens was proposed in this paper, where the authors extended the methodology to allow the imaging of micro-scale specimens.
Journal ArticleDOI

On Projection Algorithms for Solving Convex Feasibility Problems

TL;DR: A very broad and flexible framework is investigated which allows a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence in convex feasibility problems.
Related Papers (5)