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
-
Operational almost periodic alpha unpredictability
-
Finite-Time H∞ Control for Conformable Fractional-Order Nonlinear Systems with Time Delays
-
Gallai’s property for Archimedean tiling graphs on the torus
-
Two geometric constants of normed spaces related to new characterizations of inner product spaces
-
Weak and strong convergence of multi-inertial forward-backward-forward methods for solving monotone inclusions
-
Solving Certain Classes of Variational Inclusion Problems Using Linearized Splitting Algorithms with Applications
-
The Stinespring-Wittstock theory for variable exponential completely bounded maps
-
On Stability of Two New Generalized Set-Valued Functional Equations
-
The Solodov–Svaiter type proximal point algorithm on a complete geodesic space
-
Iterative criteria for oscillation of third-order linear delay dynamic equations