An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
From MaRDI portal
Publication:3704347
DOI10.1137/0906029zbMath0581.41019OpenAlexW2025680668MaRDI QIDQ3704347
Michael R. Osborne, G. Alistair Watson
Publication date: 1985
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0906029
numerical resultstotal approximation problemdata fitting problemsfinite descent algorithmvector norm minimization problem
Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30)
Related Items (10)
On orthogonal linear \(\ell_1\) approximation ⋮ Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ On a general class of matrix nearness problems ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ An algorithm for fitting circular arcs to data using the \(l_1\) norm ⋮ Estimating Hadamard operator norms, with application to triangular truncation ⋮ A Well-Tempered Landscape for Non-convex Robust Subspace Recovery ⋮ On a class of algorithms for total approximation ⋮ Robust computation of linear models by convex relaxation ⋮ Estimating the matrix \(p\)-norm
This page was built for publication: An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
