Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data

DOI10.1007/s10957-010-9791-1zbMath1219.90125OpenAlexW2028980981MaRDI QIDQ635803

Kristian Sabo, Ivan Vazler, Rudolf Scitovski

Publication date: 23 August 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9791-1

zbMATH Keywords

outliersLADleast absolute deviations\(l _{1}\)-norm approximationLAD-hyperplaneoverdetermined system of linear equationsweighted median problem

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (4)

One-dimensional center-based l 1-clustering method ⋮ Least absolute deviations problem for the Michaelis-Menten function ⋮ An existence criterion for the nonlinear \(\ell_p\)-norm fitting problem ⋮ Center-based l1–clustering method

Uses Software

• Algorithm 564

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three points method for searching the best least absolute deviations plane
• Weighted median algorithms for \(L_ 1\) approximation
• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• Solutions of systems of algebraic equations and linear maps on residue class rings
• Locating lines and hyperplanes. Theory and algorithms
• Anchored hyperplane location problems
• An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
• Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
• Weighted Median of the Data in Solving Least Absolute Deviations Problems
• On QR factorization updatings
• Algorithm 552: Solution of the Constrained I ₁ Linear Approximation Problem [F4]
• A Test Problem Generator for Discrete Linear L ₁ Approximation Problems
• Linearly Constrained Discrete I ₁ Problems
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
• Optimization of Convex Risk Functions
• Nonlinear Programming
• THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
• Gauge distances and median hyperplanes

This page was built for publication: Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data