[PDF] Top 20 The hybrid steepest descent method for solutions of equilibrium problems and other problems in fixed point theory

... The scheme (.) minimizes certain convex functions over the intersection of fixed point sets of nonexpansive mappings if A = ∇f , say, where f is a continuously Fréchet differen- tiable convex function. The scheme ... See full document

... relaxed hybrid steepest descent method for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of a variational inequality for an ... See full document

... of solutions of the system of equilibrium problems and the set of common fixed points of an infinite family of strictly pseudo-contractive mappings by using a viscosity hybrid ... See full document

... Multi-step hybrid viscosity method for systems of variational inequalities defined over sets of solutions of equilibrium problem and fixed point ...problems. Fixed ... See full document

... the hybrid steepest descent methods for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a strict pseudocontraction ... See full document

... by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi- φ -nonexpansive ...mappings. Fixed Point Theory ...for ... See full document

... The theory of equilibrium problems has played an important role in the study of a wide class of problems arising in economics, finance, transportation, network and structural analysis, ... See full document

... extragradient method for finding a common element of the set of solutions of a generalized mixed equilibrium problem and the set of fixed points of a nonexpansive mapping, and the set of ... See full document

... An explicit algorithm is introduced to solve the monotone variational inequality over a triple hierarchical problem. The strong convergence for the proposed algorithm to the solution is guaranteed under some assumptions. ... See full document

... The hybrid steepest-descent method introduced by Yamada 2001 is an algorithmic solution to the variational inequality problem over the fixed point set of nonlinear mapping and ... See full document

... of problems which arise in economics, finance, image reconstruction, ecology, trans- portation, network, elasticity and optimization; see [–] and the references ...of solutions of nonlinear operator ... See full document

... “The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithms ... See full document

... Mann-type hybrid steepest-descent iterative algorithm for finding a common element of the set of solutions of a general mixed equilibrium problem, the set of solutions of general ... See full document

... On the another hand, in , by combining Yamada’s hybrid steepest-descent method (.) with Marino and Xu’s method (.), Jung [] considered the following explicit iterative scheme ... See full document

... Let H be a real Hilbert space with the inner product and the norm being denoted by ·, · and · , respectively. Let C be a nonempty, closed, and convex subset of H and let F be a bifunction of C × C into R, where R denotes ... See full document

... approximation method for finding a common element of the set of solutions of generalized equilibrium problems, the set of common fixed points of infinitely many nonexpansive mappings, ... See full document

... “The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithms ... See full document

... the other hand, let F : H → H be a κ-Lipschitzian and η-strongly monotone operator with constants κ, η > 0, and let T : H → H be nonexpansive such that FixT / ...so-called hybrid steepest ... See full document

... our hybrid algorithm in 8. Consider VIC, F, where C is composed of fixed points of a κ-strict pseudo-contraction T : H → H such that FixT / ∅ and F : H → H is still η-strongly monotone and boundedly ...a ... See full document

... convex subset K of C which contains at least two points, there exists an element x of K which is not a diametral point of K, i.e., sup {x – y : y ∈ K} < d(K), where d(K) is the diameter of K . It is well known ... See full document