Related papers: The Method of Alternating Projections
We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two…
We investigate convergence of alternating Bregman projections between non-convex sets and prove convergence to a point in the intersection, or to points realizing a gap between the two sets. The speed of convergence is generally sub-linear,…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
We study the convergence rate of the alternating projection method (APM) applied to the intersection of an affine subspace and the second-order cone. We show that when they intersect non-transversally, the convergence rate is $O(k^{-1/2})$,…
According to the von Neumann-Halperin and Lapidus theorems, in a Hilbert space the iterates of products or, respectively, of convex combinations of orthoprojections are strongly convergent. We extend these results to the iterates of convex…
We study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \geq 1$) of a point $x$ onto a set $A$ consists of points in $A$ the…
In this article we show that positive surjective isometries between symmetric spaces associated with semi-finite von Neumann algebras are projection disjointness preserving if they are finiteness preserving. This is subsequently used to…
Given $N\ge2$ closed subspaces $M_1,\dotsc, M_N$ of a Hilbert space $X$, let $P_k$ denote the orthogonal projection onto $M_k$, $1\le k\le N$. It is known that the sequence $(x_n)$, defined recursively by $x_0=x$ and $x_{n+1}=P_N\cdots…
The notion of regular pair $(A,B)$ for two nonempty closed convex subsets $A$ and~$B$ of a Hilbert space $\H$ was introduced by Borwein and Bauschke in 1993 to ensure convergence (in norm) of the alternating projection method to some point…
It is well-known that the sequence of iterations of the composition of projections onto closed affine subspaces converges linearly to the projection onto the intersection of the affine subspaces when the sum of the corresponding linear…
We introduce and study the convergence properties of a projection-type algorithm for solving the variational inequality problem for point-to-set operators. No monotoni\-city assumption is used in our analysis. The operator defining the…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
Solving large-scale systems of nonlinear equations/inequalities is a fundamental problem in computing and optimization. In this paper, we propose a generic successive projection (SP) framework for this problem. The SP sequentially projects…
The paper is concerned with the problem of identifying the norm attaining operators in the von Neumann algebra generated by two orthogonal projections on a Hilbert space. This algebra contains every skew projection on that Hilbert space and…
In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space. This method, termed AAMR for averaged alternating modified reflections,…
We apply a new notion of angle between projections to deduce criteria for uniform convergence results of the alternating projections method under several different settings: averaged projections, cyclic products, quasi-periodic products and…
Given two nonempty and disjoint intersections of closed and convex subsets, we look for a best approximation pair relative to them, i.e., a pair of points, one in each intersection, attaining the minimum distance between the disjoint…
The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the…
A type of iterative orthogonally accumulated projection methods for solving linear system of equations are proposed in this paper. This type of methods are applications of accumulated projection(AP) technique proposed recently by authors.…
In this paper, we proposed an alternating projection based algorithm to solve a class of distributed MIN-MAX convex optimization problems. We firstly transform this MINMAX problem into the problem of searching for the minimum distance…