Additional Information
| Author(s) | Cristescu, Gabriela, Lupsa, Liana |
|---|
Subclasses of intersectional convexities for sets
Gabriela Cristescu ♦ Liana Lupsa
Abstract
carpathian_2002_18_023_030_abstractFull PDF
carpathian_2002_18_023_030In the general classification of the convexity properties for sets [4], the convexities defined as intersection of certain standard sets appear in more classes. First of all, we shall prove that all these convexity concepts are defined by segmential methods. The type of segmential method involved in the construction of an intersectional convexity lead to three classes of intersectional convexities.
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