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:
Bibliographic Details
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!