Search

In this paper we propose a parallel iterative hybrid methods for finding a common element of the solution sets of a finite family of pseudomonotone equilibrium problems and the fixed points set of a semigroup-nonexpensive mappings in Hilbert spaces. Under mild conditions, we obtain the strong convergence of the proposed iterative process. Some numerical experiments are given to verify the efficiency the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper we discuss the approach for optimal switching control problem with unknown switching points. The case with unknown switching point is more general and generalizes the results existing in the literature. By using suitable transformation, the main problem is reduced into a problem with known interval and further the unknown boundary of the integral in the minimization functional is reduced to the known one. This fact is illustrated by an example. The reduced problem is solved numerically by using the Gradient Projection Method Algorithm. [ABSTRACT FROM AUTHOR]

The number of formal concepts generated from the input context is an important parameter in the cost functions of concept formation algorithms. The calculation of concept count for any arbitrary context is a hard, NP-complete problem and only rough approximation methods can be found in the literature to solve this problem. This paper introduces an efficient numerical approximation algorithm for contexts where attribute probabilities are independent from the objects instances. The preconditions required by the approximation method are usually met in the FCA applications, thus the proposed method provides an efficient tool for practical complexity analysis, too. [ABSTRACT FROM AUTHOR]