scientific article; zbMATH DE number 3857681
From MaRDI portal
Publication:3326210
[For the entire collection see Zbl 0533.00014.] In many real data fitting problems, there are errors in the \(m\times n\) data matrix A as well as in the observation vector \(b\in {\mathbb{R}}^ m\). Some account can be taken of this by formulating and solving the 'total' approximation problem of minimizing some norm of the \(m\times(n+1)\) error matrix. For a general class of norms on the error matrix it is shown how the problem is equivalent to a vector norm minimization problem with a single equality constraint. Some characterization results are derived.
Recommendations
- An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total l₁ Problem
- scientific article; zbMATH DE number 5620293
- On a class of algorithms for total approximation
- scientific article; zbMATH DE number 205857
- Structured total least squares and \(L_ 2\) approximation problems
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3326210)