New self-adaptive step size algorithms for solving split variational inclusion problems and its applications (Q2287866): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11075-019-00683-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2923893934 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 19:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New self-adaptive step size algorithms for solving split variational inclusion problems and its applications |
scientific article |
Statements
New self-adaptive step size algorithms for solving split variational inclusion problems and its applications (English)
0 references
22 January 2020
0 references
The split variational inclusion problem, which is a special instance of the split inverse problem, is considered in this paper. Three new self-adaptive step size algorithms for solving it are described and studied. Weak and strong convergence theorems are established in real Hilbert spaces. A convex minimization problem is considered as a theoretical application of the new technique. The paper concludes with several numerical experiments, academic as well as in the field of compressed sensing, that illustrate and compare the performance of the algorithm.
0 references
split variational inclusion problem
0 references
convex minimization problems
0 references
self-adaptive
0 references
strong convergence
0 references