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

Primal necessary characterizations of transversality properties

TL;DR: In this paper, the authors studied general nonlinear transversality properties of collections of sets and formulated geometric, metric and slope characterizations of the properties, particularly in the convex setting.
Journal ArticleDOI

Denoising Poisson Phaseless Measurements via Orthogonal Dictionary Learning

TL;DR: A dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements is proposed, which, by preserving texture features, produce visually and quantitatively improved restored images compared with other phase retrieval algorithms without regularization and local sparsity promoting algorithms.
Journal ArticleDOI

Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems

TL;DR: This paper establishes several local linear convergence results for the generalized Douglas–Rachford algorithm and its cyclic variants which include many projection-type methods such as the classical Douglas– Rachford algorithms and the alternating projection algorithm.
Posted Content

Necessary conditions for linear convergence of Picard iterations and application to alternating projections

TL;DR: In this article, it was shown that subtransversality is necessary for R-linear convergence to fixed points of iterates of the alternating projections sequence of fixed point mappings.
Journal ArticleDOI

Local Linear Convergence for Inexact Alternating Projections on Nonconvex Sets

TL;DR: In this paper, the authors show that computationally cheap inexact projections may suffice instead of exact projection onto nonconvex sets, if one set is defined by sufficiently regular smooth constraints, then projecting onto the approximation obtained by linearizing those constraints around the current iterate suffices.
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)