A Hybrid Subgradient Algorithm for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudocontraction Mappings | Zendy

Ekkarath Thailert | Zendy; Rabian Wangkeeree | Zendy; Chanoksuda Khantree | Zendy

Open Access

A Hybrid Subgradient Algorithm for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudocontraction Mappings

Author(s) -

Ekkarath Thailert,

Rabian Wangkeeree,

Chanoksuda Khantree

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/142671

Subject(s) - subgradient method , mathematics , complement (music) , hilbert space , class (philosophy) , convergence (economics) , set (abstract data type) , lipschitz continuity , solution set , algorithm , point (geometry) , mathematical optimization , discrete mathematics , computer science , pure mathematics , phenotype , geometry , biochemistry , chemistry , artificial intelligence , complementation , programming language , economics , gene , economic growth

We propose a new strongly convergent algorithm for finding a common point in the solution set of a class of pseudomonotone equilibrium problems and the set of common fixed points of a family of strict pseudocontraction mappings in a real Hilbert space. The strong convergence theorem of proposed algorithms is investigated without the Lipschitz condition for the bifunctions. Our results complement many known recent results in the literature

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research