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

Error Bounds and Hölder Metric Subregularity

TL;DR: In this article, the Holder setting of the metric subregularity property of set-valued mappings between general metric or Banach/Asplund spaces is investigated in the framework of the theory of error bounds for extended real-valued functions of two variables.
Journal ArticleDOI

Proximity operators for phase retrieval.

TL;DR: A new formulation of a family of proximity operators that generalize the projector step for phase retrieval and admit closed form solutions for both the Gaussian and the Poisson cases for under-sampled intensity measurements is presented.
Posted Content

On the local convergence of the Douglas-Rachford algorithm

TL;DR: In this paper, the feasibility problem of the Douglas-Rachford algorithm for finite unions of convex sets was studied and its local convergence was shown to converge to a fixed point.
Journal ArticleDOI

Phase Retrieval with One or Two Diffraction Patterns by Alternating Projections with the Null Initialization

TL;DR: In this article, the authors proposed the alternating projection (AP) of various forms, including the parallel AP (PAP), real-constrained AP (RAP), and serial AP (SAP), to solve phase retrieval with at most two coded diffraction patterns.
Journal ArticleDOI

Necessary conditions for linear convergence of iterated expansive, set-valued mappings

TL;DR: In this article, the authors present necessary conditions for monotonicity of fixed point iterations of mappings that may violate the usual nonexpansive property, and specialize these results to the alternating projections iteration where the metric subregularity property takes on a distinct geometric characterization of sets at points of intersection called subtransversality.
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)