Related papers: How to project onto the intersection of a closed a…
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 provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
The projection onto the intersection of sets generally does not allow for a closed form even when the individual projection operators have explicit descriptions. In this work, we systematically analyze the projection onto the intersection…
The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces. We propose acceleration schemes making use of two ideas:…
In a Hilbert space, we study the strong convergence of alternating projections between two inconsistent affine subspaces with varying relaxation on one side. New convergence results are obtained by seeing the alternating projections as a…
Sets of bilinear constraints are important in various machine learning models. Mathematically, they are hyperbolas in a product space. In this paper, we give a complete formula for projections onto sets of bilinear constraints or hyperbolas…
A recent paper showed how to find sets of finite affine or projective planes constructed on a common set of points, so that lines of one plane meet lines of a different plane in at most two points. In this paper, those results are…
We provide a sufficient condition for a finite number of closed subspaces of a Hilbert space to be linearly independent and their sum to be closed. Under this condition a formula for the orthogonal projection onto the sum is given. We also…
We introduce and analyze an abstract algorithm that aims to find the projection onto a closed convex subset of a Hilbert space. When specialized to the fixed point set of a quasi nonexpansive mapping, the required sufficient condition…
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in a Hilbert space. Our arguments are based on nonexpansive mapping theory.
The goal of this paper is to construct the Hilbert scheme of complete intersections in the biprojective space $X=\mathbb{P}^m\times\mathbb{P}^n$ and for this, we define a partial order on the bidegrees of the bihomogeneous forms. As a…
A popular method for finding the projection onto the intersection of two closed convex subsets in Hilbert space is Dykstra's algorithm. In this paper, we provide sufficient conditions for Dykstra's algorithm to converge rapidly, in finitely…
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,…
Let H be a Hilbert space, L(H) the algebra of all bounded linear operators on H and <, >_A : H \times H \to C the bounded sesquilinear form induced by a selfadjoint A in L(H), < \xi, \eta >_A = < A \xi, \eta >, \xi, \eta in H. Given T in…
We present a method to project a hypercube of arbitrary dimension on the plane, in such a way as to preserve, as well as possible, the distribution of distances between vertices. The method relies on a Montecarlo optimization procedure that…
Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
The 2-sets convex feasibility problem aims at finding a point in the nonempty intersection of two closed convex sets $A$ and $B$ in a Hilbert space $X$. The method of alternating projections is the simplest iterative procedure for finding a…
Given a smooth subscheme of a projective space over a finite field, we compute the probability that its intersection with a fixed number of hypersurface sections of large degree is smooth of the expected dimension. This generalizes the case…