The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems (Q1723940)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems |
scientific article; zbMATH DE number 7022234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems |
scientific article; zbMATH DE number 7022234 |
Statements
The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems (English)
0 references
14 February 2019
0 references
Summary: 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.
0 references
implicit iteration method
0 references
hybird steepest descent method
0 references
0 references
0 references
0 references
0 references
0 references
