On orthogonal linear _1 approximation
DOI10.1007/BF01400354zbMATH Open0633.65010OpenAlexW2064346177MaRDI QIDQ1096313FDOQ1096313
Authors: Helmuth Späth, G. A. Watson
Publication date: 1987
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133211
Recommendations
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- A simple solution to the \(\ell ^ 1\) optimization problem
- An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
- scientific article; zbMATH DE number 2127843
- Linear best approximation using a class of polyhedral norms
convergencestabilityalgorithmminimization problemdata fittinglocal solutionsconcave quadratic programming problemorthogonal \(\ell _ 1\)-approximationorthogonal \(\ell _ 1\)-fitting
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50)
Cites Work
- An Analysis of the Total Least Squares Problem
- Title not available (Why is that?)
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Methods for Linear Orthogonal Lp Approximation
- Title not available (Why is that?)
Cited In (18)
- Title not available (Why is that?)
- Estimating the matrix \(p\)-norm
- A pure \(L_1\)-norm principal component analysis
- An algorithm for fitting circular arcs to data using the \(l_1\) norm
- Piecewise Linear Orthogonal Approximation
- Dual principal component pursuit
- Three points method for searching the best least absolute deviations plane
- A simple solution to the \(\ell ^ 1\) optimization problem
- \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Median hyperplanes in normed spaces -- a survey
- Robust computation of linear models by convex relaxation
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- Title not available (Why is that?)
- \(L_1\) optimization under linear inequality constraints
- Title not available (Why is that?)
- The \(L_1\)-norm best-fit hyperplane problem
- Minsum hyperspheres in normed spaces
This page was built for publication: On orthogonal linear \(\ell_1\) approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096313)