The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems

Jitsupa Deepho and Poom Kumam

Abstract and Applied Analysis, 2014, vol. 2014, 1-13

Abstract:

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/365203.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/365203.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:365203

DOI: 10.1155/2014/365203

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().