Related papers: Alternating projections between two inconsistent a…
We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…
We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible set is defined by a nonlinear and nonsmooth continuous…
Let $L_1,L_2,\dots,L_K$ be a family of closed subspaces of a Hilbert space $H$, $L_1\cap \dots \cap L_K =\{0\}$; let $P_k$ be the orthogonal projection onto $L_k$. We consider two types of consecutive projections of an element $x_0\in H$:…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
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…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Finite geometry is employed to underpin operators in finite, d, dimensional Hilbert space. The central role of mutual unbiased bases (MUB) states projectors is exhibited. Interrelation among operators in Hilbert space, revealed through…
Coherent states in a projected Hilbert space have many useful properties. When there are conserved quantities, a representation of the entire Hilbert space is not necessary. The same issue arises when conditional observations are made with…
This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin…
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 work out details of the extrinsic geometry for two Hilbert schemes of some contemporary interest: the Hilbert scheme of two points on the projective plane and the dense open set parametrizing non-planar clusters in the punctual Hilbert…
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence…
We study the alternating algorithm for the computation of the metric projection onto the closed sum of two closed subspaces in uniformly convex and uniformly smooth Banach spaces. For Banach spaces which are convex and smooth of power type,…
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$ under a mild regularity hypothesis on one of the sets. We…
We construct a class of super-reflexive complementably minimal spaces, and study uniformly convex distortions of the norm on Hilbert space by using methods of complex interpolation.