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

Jitsupa Deepho; Poom Kumam

doi:10.1155/2014/365203

Translator Disclaimer

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

Jitsupa Deepho, Poom Kumam

Abstr. Appl. Anal. 2014(SI32): 1-13 (2014). DOI: 10.1155/2014/365203

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.

Citation

Download Citation

Jitsupa Deepho. Poom Kumam. "The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems." Abstr. Appl. Anal. 2014 (SI32) 1 - 13, 2014. https://doi.org/10.1155/2014/365203