The \(L_1\)-norm best-fit hyperplane problem

DOI10.1016/j.aml.2012.03.031zbMath1255.65111OpenAlexW2001596810WikidataQ41824477 ScholiaQ41824477MaRDI QIDQ1761564

J. Paul Brooks, José H. Dulá

Publication date: 15 November 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.03.031

zbMATH Keywords

algorithmlocation theorylinear programmingcomputer visionmultivariate statistics\(L_1\) norm\(L_{1}\) projection\(L_1\) regressionbest-fit hyperplane problemsubspace fitting

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Numerical mathematical programming methods (65K05) Linear programming (90C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

A pure \(L_1\)-norm principal component analysis ⋮ Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering ⋮ A combinatorial approach to \(L_1\)-matrix factorization ⋮ The Fast Cauchy Transform and Faster Robust Linear Regression ⋮ On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation ⋮ Optimization for L₁-Norm Error Fitting via Data Aggregation

This page was built for publication: The \(L_1\)-norm best-fit hyperplane problem