Sentence examples for a class of split from inspiring English sources

The main aim of this paper is to propose an iterative method to find an element for solving a class of split feasibility problems under weaker conditions.

The main aim of this paper is to propose an iterative algorithm to find an element for solving a class of split mixed equilibrium problems and fixed point problems for λ-hybrid multivalued mappings under weaker conditions.

As our main result, we propose an iterative method for finding an element to solve a class of split variational inequality problems under weaker conditions and get a weak convergence theorem.

In this paper, based on the work by Censor et al. combined with Korpelevich's extragradient method and Byrne's CQ algorithm, we propose an iterative method for finding an element to solve a class of split variational inequality problems under weaker conditions and get a weak convergence theorem.

The main aim of this paper is to propose an iterative algorithm based on the shrinking projection method to find an element for solving a class of split generalized equilibrium problems and fixed point problems for a countable family of nonexpansive multivalued mappings in real Hilbert spaces.

This is an unrooted phylogenetic network with the property that every split S= A∣ B in Σ is represented in N by a set of parallel edges, such that deleting all edges in the set will result in exactly two connected components, one labeled by the taxa in A and the other labeled by B. A class of splits of particular interest are the circular splits.

To remedy this situation, based on previous work in the context of ordinary differential equations, we construct a class of Strang splitting schemes that are symmetric up to a desired order.

In 2013, Kazmi and Rizvi [14] considered a new class of split equilibrium problems.

The new feasibility test is extended to test the feasibility of a proposed class of split, which is defined by the specification of product regions, or sets of product compositions.

First, we consider a class of the generalized split feasibility problems (GSFP): finding an element that solves a variational inequality problem such that its image under a given bounded linear operator is in a fixed point set of a nonexpansive mapping, i.e., find (x^) satisfying x^in operatorname {VI}(C,f) quad text{and} quad Ax^in operatorname {Fix}(T).

We also introduce a new class of split-plot designs with mirror image pairs constructed from non-geometric Plackett Burman designs.