Hybrid Steepest-Descent Methods for Triple Hierarchical Variational Inequalities
We introduce and analyze a relaxed iterative algorithm by combining Korpelevich’s extragradient method, hybrid steepest-descent method, and Mann’s iteration method. We prove that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of i...
Saved in:
Main Authors: | L. C. Ceng, A. Latif, C. F. Wen, A. E. Al-Mazrooei |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2015-01-01
|
Series: | Journal of Function Spaces |
Online Access: | http://dx.doi.org/10.1155/2015/980352 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
by: Jitsupa Deepho, et al.
Published: (2014-01-01) -
Triple Hierarchical Variational Inequalities with Constraints of Mixed Equilibria, Variational Inequalities, Convex Minimization, and Hierarchical Fixed Point Problems
by: Lu-Chuan Ceng, et al.
Published: (2014-01-01) -
Bounding Regions to Plane Steepest Descent Curves of Quasiconvex Families
by: Marco Longinetti, et al.
Published: (2016-01-01) -
An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems
by: Chein-Shan Liu
Published: (2013-01-01) -
Fractional Partial Differential Equation: Fractional Total Variation and Fractional Steepest Descent Approach-Based Multiscale Denoising Model for Texture Image
by: Yi-Fei Pu, et al.
Published: (2013-01-01)