The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
We introduced an implicit and an explicit iteration method based on the hybrid steepest descent method for finding a common element of the set of solutions of a constrained convex minimization problem and the set of solutions of a split variational inclusion problem.
Saved in:
Main Authors: | Jitsupa Deepho, Poom Kumam |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/365203 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Modified Hybrid Steepest-Descent by Using a Viscosity Approximation Method with a Weakly Contractive Mapping for a System of Equilibrium Problems and Fixed Point Problems with Minimization Problems
by: Uamporn Witthayarat, et al.
Published: (2012-01-01) -
Hybrid Steepest-Descent Methods for Triple Hierarchical Variational Inequalities
by: L. C. Ceng, et al.
Published: (2015-01-01) -
Iterative Algorithms for Solving the System of Mixed Equilibrium Problems, Fixed-Point Problems, and Variational Inclusions with Application to Minimization Problem
by: Tanom Chamnarnpan, et al.
Published: (2012-01-01) -
Bounding Regions to Plane Steepest Descent Curves of Quasiconvex Families
by: Marco Longinetti, et al.
Published: (2016-01-01) -
Iterative Algorithms for Mixed Equilibrium Problems, System of Quasi-Variational Inclusion, and Fixed Point Problem in Hilbert Spaces
by: Poom Kumam, et al.
Published: (2014-01-01)