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: | , |
|---|---|
| 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!
|
| _version_ | 1832565355933859840 |
|---|---|
| author | Jitsupa Deepho Poom Kumam |
| author_facet | Jitsupa Deepho Poom Kumam |
| author_sort | Jitsupa Deepho |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-207c4323456c446f8b55d1ffb5e40e38 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-207c4323456c446f8b55d1ffb5e40e382025-02-03T01:08:00ZengWileyAbstract and Applied Analysis1085-33751687-04092014-01-01201410.1155/2014/365203365203The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization ProblemsJitsupa Deepho0Poom Kumam1Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha Uthit Road, Bang Mod, Thung Khru, Bangkok 10140, ThailandDepartment of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha Uthit Road, Bang Mod, Thung Khru, Bangkok 10140, ThailandWe 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.http://dx.doi.org/10.1155/2014/365203 |
| spellingShingle | Jitsupa Deepho Poom Kumam The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems Abstract and Applied Analysis |
| title | The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems |
| title_full | The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems |
| title_fullStr | The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems |
| title_full_unstemmed | The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems |
| title_short | The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems |
| title_sort | hybrid steepest descent method for split variational inclusion and constrained convex minimization problems |
| url | http://dx.doi.org/10.1155/2014/365203 |
| work_keys_str_mv | AT jitsupadeepho thehybridsteepestdescentmethodforsplitvariationalinclusionandconstrainedconvexminimizationproblems AT poomkumam thehybridsteepestdescentmethodforsplitvariationalinclusionandconstrainedconvexminimizationproblems AT jitsupadeepho hybridsteepestdescentmethodforsplitvariationalinclusionandconstrainedconvexminimizationproblems AT poomkumam hybridsteepestdescentmethodforsplitvariationalinclusionandconstrainedconvexminimizationproblems |