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

Perturbation of error bounds

TL;DR: New concepts of (arbitrary, convex and linear) perturbations of the given function defining the system under consideration are proposed, which turn out to be a useful tool in the analysis.
Dissertation

Contributions en optimisation non lisse et applications dans le domaine de l'aéronautique et du spatial

TL;DR: In this article, Kurdyka-Lojasiewicz et al. propose an algorithm for non-lisse and non convexe optimisation of the H2/H structure.
Journal ArticleDOI

Linear Convergence of Projection Algorithms

TL;DR: In this article, the authors studied linear convergence of several projection algorithms for systems of finitely many closed sets and showed that the convergence of these algorithms is linear with the number of closed sets.
Journal ArticleDOI

Transversality Properties: Primal Sufficient Conditions

TL;DR: In this paper, the authors developed a general framework for quantitative analysis of transversality properties in the nonlinear setting, which allows them to unify the existing results on the topic.
Posted Content

Nonnegative Low Rank Tensor Approximation and its Application to Multi-dimensional Images

TL;DR: Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than that of existing NTF methods.
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)