On a class of algorithms for total approximation (Q1068508): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0021-9045(85)90047-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2092086025 / rank | |||
Normal rank |
Revision as of 20:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a class of algorithms for total approximation |
scientific article |
Statements
On a class of algorithms for total approximation (English)
0 references
1985
0 references
Let A be a given \(m\times n\) matrix and let \(b\in {\mathbb{R}}^ n\) with \(m>n\) and define \(Z:=(A,b)\). The following total approximation problem is considered: Find \(v\in {\mathbb{R}}^{n+1}\) to minimize \(\| Zv\|_ p\) such that \(\| v'\|_ q=1\) where \(p+q=pq\) and v' is obtained from v by deleting the first k components (usually \(k=0)\). A class of algorithms is proposed and a local convergence analysis as well as a partial global convergence analysis for it are given.
0 references
linear data fitting
0 references
total approximation problem
0 references
local convergence
0 references
global convergence
0 references