Search

In this paper, we study a generalized variational inclusion problem involving difference of monotone operators in Hilbert spaces. We established equivalence between the generalized variational inclusion problem and a fixed point problem. We establish an Ishikawa type iterative algorithm for solving a generalized variational inclusion problem involving difference of monotone operators, which is more general than Mann-type iterative algorithm. An existence result as well as a convergence result are proved separately. The problem of this paper is more general than many existing problems in the literature. Several special cases of generalized variational inclusion problem involving difference of monotone operators are also mentioned. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study a random variational-like inclusion and its corresponding random proximal operator equation for random fuzzy mappings. It is established that the random variational-like inclusion problem for random fuzzy mappings is equivalent to a random fixed point problem. We also establish a relationship between random variational-like inclusion and random proximal operator equation for random fuzzy mappings. This equivalence is used to define an iterative algorithm for solving random proximal operator equation for random fuzzy mappings. Through an example, we show that the random Wardrop equilibrium problem is a special case of the random variational-like inclusion problem for random fuzzy mappings. [ABSTRACT FROM AUTHOR]

We address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the algorithms of Burkard and Krarup (1998), and Lan and Wang (2000). These algorithms are complicated and need efforts. Hence, we develop in this paper a simpler algorithm. First, we construct a condition for a cycle that contains a 1-median or for a vertex that is indeed a 1-median of the cactus. Based on this condition, we localize the search for deriving a 1-median on the underlying cactus. Complexity analysis shows that the approach runs in linear time. [ABSTRACT FROM AUTHOR]