On two projection algorithms for the multiple-sets split feasibility problem (Q1789864)
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: On two projection algorithms for the multiple-sets split feasibility problem |
scientific article; zbMATH DE number 6950625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two projection algorithms for the multiple-sets split feasibility problem |
scientific article; zbMATH DE number 6950625 |
Statements
On two projection algorithms for the multiple-sets split feasibility problem (English)
0 references
10 October 2018
0 references
Summary: We present a projection algorithm which modifies the method proposed by \textit{Y. Censor} and \textit{T. Elfving} [Numer. Algorithms 8, No. 2--4, 221--239 (1994; Zbl 0828.65065)] and also introduce a self-adaptive algorithm for the multiple-sets split feasibility problem (MSFP). The global rates of convergence are firstly investigated and the sequences generated by two algorithms are proved to converge to a solution of the MSFP. The efficiency of the proposed algorithms is illustrated by some numerical tests.
0 references
