Additional Information
| Author(s) | Mărușter, Laura, Mărușter, Ștefan |
|---|
On convex feasibility problems
Laura Mărușter ♦ Ștefan Mărușter
Abstract
carpathian_2005_21_083_087_abstractFull PDF
carpathian_2005_21_083_087In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration