Algorithms for Solving the Variational Inequality Problem over the Triple Hierarchical Problem | Zendy

Thanyarat Jitpeera | Zendy; Poom Kumam | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algorithms for Solving the Variational Inequality Problem over the Triple Hierarchical Problem

Author(s) -

Thanyarat Jitpeera,

Poom Kumam

Publication year - 2012

Publication title -

abstract and applied analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 56

eISSN - 1687-0409

pISSN - 1085-3375

DOI - 10.1155/2012/827156

Subject(s) - mathematics , variational inequality , monotone polygon , convergence (economics) , inequality , set (abstract data type) , fixed point , point (geometry) , solution set , mathematical optimization , mathematical analysis , computer science , geometry , economics , programming language , economic growth

This paper discusses the monotone variational inequality over the solution set of the variationalinequality problem and the fixed point set of a nonexpansive mapping. The strong convergencetheorem for the proposed algorithm to the solution is guaranteed under some suitable assumptions

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