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
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter