نتایج جستجو برای: strongly monotone mapping

تعداد نتایج: 423698  

2011
Yuan Qing Xiaolong Qin Haiyun Zhou Shin Min Kang Ljubomir B. Ciric

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...

Journal: :J. Applied Mathematics 2012
Tanom Chamnarnpan Poom Kumam

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...

2009
Chaichana Jaiboon Poom Kumam Wataru Takahashi

We introduce a new hybrid extragradient viscosity approximationmethod for finding the common element of the set of equilibrium problems, the set of solutions of fixed points of an infinitely many nonexpansive mappings, and the set of solutions of the variational inequality problems for β-inverse-strongly monotone mapping in Hilbert spaces. Then, we prove the strong convergence of the proposed i...

2016
Morad Ali Payvand Sedigheh Jahedi

The purpose of this paper is to introduce a new iterative algorithm for finding a common element of the set of solutions of a system of generalized mixed equilibrium problems, the set of common fixed points of a finite family of pseudo contraction mappings, and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a real Hilbert space. We establish resul...

2014
Philipp Kindermann André Schulz Joachim Spoerhase Alexander Wolff

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...

2012
Wutiphol Sintunavarat Poom Kumam Yeol Je Cho

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...

2014
Pongsakorn Sunthrayuth Poom Kumam

and Applied Analysis 3 The generalized mixed equilibrium problems with perturbation is very general in the sense that it includes fixed point problems, optimization problems, variational inequality problems, Nash equilibrium problems, and equilibrium problems as special cases see, e.g., 4, 5 . Numerous problems in physics, optimization, and economics reduce to find a solution of problem 1.2 . S...

2011
Poom Kumam Chaichana Jaiboon Jong Kim

We introduce an iterative algorithm for finding a common element of the set of fixed points of strict pseudocontractions mapping, the set of common solutions of a system of two mixed equilibrium problems and the set of common solutions of the variational inequalities with inverse strongly monotone mappings. Strong convergence theorems are established in the framework of Hilbert spaces. Finally,...

2004
RAM U. VERMA

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...

2008
Mathias Beiglböck Martin Goldstern Gabriel Maresch Walter Schachermayer

We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are optimal, provided the cost function c is either lower semi-continuous and finite, or continuous and may possibly attain the value ∞. We show that this is true i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید