Family constraining of iterative algorithms (Q2249830): Difference between revisions
From MaRDI portal
Latest revision as of 17:57, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Family constraining of iterative algorithms |
scientific article |
Statements
Family constraining of iterative algorithms (English)
0 references
3 July 2014
0 references
Given an algorithmic operator \(Q: \mathbb{R}^n \to \mathbb{R} \) between Euclidean spaces, the original iterative process may have the form \(x^{k+1}=Q(x^k),\) for all \(k \geq 0\) under various assumptions on \(Q\). A new iterative process \(x^{k+1}=S_k Q(x^k),\) for all \(k\geq 0,\) where \(\{S_k\}_{k=0}^\infty\) is a family of operators \(S_k : \mathbb{R}^n\to \mathbb{R}^m\) is constructed. The main purpose of this article is to study the possibility to constrain an algorithm with a family of operators and to analyze the the asymptotic behavior of such family-constrained operator.
0 references
constraining strategy
0 references
strictly nonexpansive operators
0 references
fixed points set
0 references
least squares problems
0 references
image reconstrution from projections
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references