The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in a Euclidean space, may lead to slow convergence of the constructed sequence when that sequence enters some narrow “corridor” between two or more convex sets. A way to leave such corridor consists in taking a big step at different moments during the iteration, because in that way the monotoneous behaviour that is responsible for the slow convergence may be interrupted. In this paper we present a technique that may introduce interruption of the monotony for a sequential algorithm, but that at the same time guarantees convergence of the constructed sequence to a point in the intersection of the sets. We compare experimentally the behaviour concerning the speed of convergence of the new algorithm with that of an existing monotoneous algorithm.
We use reflections with respect to submanifolds and related geometric results to develop, inspired by the work of Ferus and other authors, in a unified way a local theory of extrinsic symmetric immersions and submanifolds in a general analytic Riemannian manifold and in locally symmetric spaces. In particular we treat the case of real and complex space forms and study additional relations with holomorphic and symplectic reflections when the ambient space is almost Hermitian. The global case is also taken into consideration and several examples are given.