Iterative methods for finding fixed points of non-expansive operators in Hilbert spaces have
been described in many publications. In this monograph we try to present the methods in a …

Due to their utility and broad applicability in many areas of applied mathematics and
physical science (eg, computerized tomography, Navier–Stokes equations, pattern …

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 …

We present a general scheme for solving the convex feasibility problem and prove its
convergence under mild conditions. Unlike previous schemes no exact projections are …

In Chap. 5 we present iterative methods for solving several convex optimization problems in
a Hilbert space: the common fixed point problem, convex feasibility problem, split feasibility …

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 …

Abstract Large-scale Support Vector Machine (SVM) classification is a very active research
line in data mining. In recent years, several efficient SVM generation algorithms based on …

Accelerating the Convergence of the Method of Alternating Projections Via a Line Search: a
Brief Survey - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …

This paper formulates an incomplete projection algorithm that is applied to the image
recovery problem. The algorithm allows an easy implementation of dynamic load balancing …

The exponential stability with a nonsmooth Lyapunov function for a class of hybrid systems
is studied in this paper. First, a sufficient condition is derived that has to be satisfied by the …