Related papers: On cluster points of alternating projections
Let $A$ be a closed affine subspace and let $B$ be a hyperplane in a Hilbert space. Suppose we are given their associated nearest point mappings $P_A$ and $P_B$, respectively. We present a formula for the projection onto their intersection…
A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that…
The aim of this paper is to revise the theory of clusters of infinitely near points for arbitrary fields. We describe in particular the intersection matrix of such a cluster, we introduce the notion of curvette over an arbitrary field and…
$\mathbb B$-convexity was defined in [7] as a suitable Kuratowski-Painlev\'e upper limit of linear convexities over a finite dimensional Euclidean vector space. Excepted in the special case where convex sets are subsets of $\mathbb R^n_ +$,…
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.
Inverse limits, unlike direct limits, can in general be void, [1]. The existence of fixed points for arbitrary mappings $T : X \longrightarrow X$ is conjectured to be equivalent with the fact that related direct limits of all finite…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
We consider the set of pairs of orthogonal vectors in Hilbert space, which is also called the cross because it is the union of the horizontal and vertical axes in the Euclidean plane when the underlying space is the real line. Crosses,…
We establish a general `gluing theorem', which states roughly that if two nondegenerate constant mean curvature surfaces are juxtaposed, so that their tangent planes are parallel and very close to one another, but oppositely oriented, then…
Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable conditions, one might have additional bounds on the distance of…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…
In this paper, we study the deformation of the intersection of one compact set with a closed neighborhood of another compact set by changing the radius of this neighborhood. It is shown that in finite-dimensional normed spaces, in the case…
The motivating problem addressed by this paper is to describe those non-degenerate sets of points $Z$ in $\mathbb P^3$ whose general projection to a general plane is a complete intersection of curves in that plane. One large class of such…
Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…
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…
We establish a region of convergence for the proto-typical non-convex Douglas-Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration [2] was only able to establish local…
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…