and Applied Analysis 3 4 strictly η-monotone if 〈 u − v, ηx, y > 0, ∀x, y ∈ H, x / y, u ∈ M x , v ∈ M ( y ) ; 2.5 5 strongly monotone if there exists a constant r > 0 satisfying 〈 u − v, x − y ≥ r∥x − y∥2, ∀x, y ∈ H, u ∈ M x , v ∈ My; 2.6 6 strongly η-monotone if there exists a constant r > 0 satisfying 〈 u − v, ηx, y ≥ r∥x − y∥2, ∀x, y ∈ H, u ∈ M x , v ∈ My; 2.7 7 maximal monotone resp., maxim...

In this paper, the concept of the strongly monotone type mapping is introduced, which contains the strongly monotone mapping and firmly type nonexpansive mapping as special cases. We show the equivalence between the fixed point problem and the complementarity problem of strongly monotone type mapping. Furthermore, it is obtained that an iteration sequence strongly converges to a unique solution...

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

We introduce and study a new system of nonlinear variational-like inclusions involving sG, η maximal monotone operators, strongly monotone operators, η-strongly monotone operators, relaxed monotone operators, cocoercive operators, λ, ξ -relaxed cocoercive operators, ζ, φ, g-relaxed cocoercive operators and relaxed Lipschitz operators in Hilbert spaces. By using the resolvent operator technique ...

We design an approximation algorithm for maximizing \(\alpha\)-bisubmodular function with matroid constraint, where the is a generalization of bisubmodular function. The concept \(\alpha\)- bisubmodularity provided by Huber, Krokhin, and Powell [[1], 2014], rank delta-matroids cut capacity directed networks have \(\alpha\)-bisubmodularity. consider two cases problem, monotone non-monotone objec...

A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the direction of the line segment connecting the two vertices. We present algorithms to compute crossing-free strongly monotone drawings for some classe...

We consider the general class of strongly Fejer monotone map-pings and some of their basic properties. These properties are useful for a convergence theory of corresponding iterative methods which are widely used to solve convex problems (see e.g. 3], 6], 7], 10]). In part I we study the relation between these mappings and their relaxations. 1 Strongly Fejer monotone mappings Let H be a (real) ...