Spingarn’s method of partial inverses has found many applications in nonlinear analysis and in optimization. We show that it can be employed to solve composite monotone inclusions in duality, thus opening a new range of applications for the partial inverse formalism. The versatility of the resulting primal-dual splitting algorithm is illustrated through applications to structured monotone inclu...

In this paper we introduce a viscosity relaxed-extragradient method for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping in a real Hilbert space H . The viscosity relaxed-extragradient method is based on two methods: extragradientlike approximation method and ...

Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas σ1, σ2, and σ3, the composition problem is to find an equivalent mapping over only σ1 and σ3. We describe a new composition algorithm that targets practical applications. It incorporates view unfolding. It eliminates as many σ2 symbols as possible, even if not all can be eliminated. It c...

Such a set G is said to be maximal monotone if it is maximal among monotone sets in the sense of set inclusion, and a mapping T is said to be maximal monotone if its graph G(T) is a maximal monotone set. For reflexive Banach spaces X and mappings T with D(T)~X, the basic result obtained independently by Browder [2] and Minty [20] states that if T is a monotone operator from D(T)=X to X* which i...

Let H be a real Hilbert space. A mapping A : D(A) ⊆ H → H is said to be monotone if ⟨Ax − Ay, x − y⟩ ≥ 0 for every x, y ∈ D(A). A is called maximal monotone if it is monotone and the R(I + rA) = H, the range of (I + rA), for each r > 0, where I is the identity mapping on H. A is said to satisfy the range condition if cl(D(A)) ⊆ R(I + rA) for each r > 0. For monotone mappings, there are many rel...

Let H be a Hilbert space and C a nonempty closed convex subset of H. Let A : C → H be a maximal monotone mapping and f : C → C a bounded demicontinuous strong pseudocontraction. Let {xt} be the unique solution to the equation f x x tAx. Then{xt} is bounded if and only if {xt} converges strongly to a zero point of A as t → ∞ which is the unique solution in A−1 0 , where A−1 0 denotes the zero se...

We introduce a new iterative algorithm for solving a common solution of the set of solutions of fixed point for an infinite family of nonexpansive mappings, the set of solution of a system of mixed equilibrium problems, and the set of solutions of the variational inclusion for a β-inversestrongly monotone mapping in a real Hilbert space. We prove that the sequence converges strongly to a common...

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with n vertices on an O(n) × O(n) grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (un...

In this paper, we show the existence of a coupled fixed point theorem of nonlinear contraction mappings in complete metric spaces without the mixed monotone property and give some examples of a nonlinear contraction mapping, which is not applied to the existence of coupled fixed point by using the mixed monotone property. We also study the necessary condition for the uniqueness of a coupled fix...

Let T : K → H be a mapping from a nonempty closed convex subset K of a finitedimensional Hilbert space H into H . Let f : K → R be proper, convex, and lower semicontinuous on K and let h : K → R be continuously Frećhet-differentiable on K with h′ (gradient of h), α-strongly monotone, and β-Lipschitz continuous on K . Then the sequence {xk} generated by the general auxiliary problem principle co...