Results 1  10
of
1,202,794
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 330 (44 self)
 Add to MetaCart
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some
Hilbertian convex feasibility problem: Convergence of projection methods
 APPL. MATH. OPTIM
, 1997
"... The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are m ..."
Abstract

Cited by 41 (16 self)
 Add to MetaCart
The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses
ITERATIVE ALGORITHM FOR A CONVEX FEASIBILITY PROBLEM
"... The purpose of this paper is to study convex feasibility problems in the setting of a real Hilbert space. The approximation of common elements of solution set of variational inequality problems and fixed point set of nonexpansive mappings is considered. Strong convergence theorems are established in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The purpose of this paper is to study convex feasibility problems in the setting of a real Hilbert space. The approximation of common elements of solution set of variational inequality problems and fixed point set of nonexpansive mappings is considered. Strong convergence theorems are established
Extrapolation algorithm for affineconvex feasibility problems
, 2005
"... The convex feasibility problem under consideration is to find a common point of a countable family of closed affine subspaces and convex sets in a Hilbert space. To solve such problems, we propose a general parallel blockiterative algorithmic framework in which the affine subspaces are exploited to ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
The convex feasibility problem under consideration is to find a common point of a countable family of closed affine subspaces and convex sets in a Hilbert space. To solve such problems, we propose a general parallel blockiterative algorithmic framework in which the affine subspaces are exploited
An Explicit Iteration Method for Convex Feasibility Problems in Hilbert Spaces
"... The purpose of this note is to present an explicit iteration method that converges strongly for solving convex feasibility problems in Hilbert spaces. ..."
Abstract
 Add to MetaCart
The purpose of this note is to present an explicit iteration method that converges strongly for solving convex feasibility problems in Hilbert spaces.
Averaging strings of sequential iterations for convex feasibility problems
 in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications
, 2001
"... a ..."
How good are projection methods for convex feasibility problems
, 2006
"... Online appendix to the paper “How good are ..."
E.: Convergence of stringaveraging projection schemes for inconsistent convex feasibility problems
 Optim. Methods Softw
, 2003
"... We study iterative projection algorithms for the convex feasibility problem of Þnding a point in the intersection of Þnitely many nonempty, closed and convex subsets in the Euclidean space. We propose (without proof) an algorithmic scheme which generalizes both the stringaveraging algorithm and the ..."
Abstract

Cited by 23 (13 self)
 Add to MetaCart
We study iterative projection algorithms for the convex feasibility problem of Þnding a point in the intersection of Þnitely many nonempty, closed and convex subsets in the Euclidean space. We propose (without proof) an algorithmic scheme which generalizes both the stringaveraging algorithm
Results 1  10
of
1,202,794