Three points method for searching the best least absolute deviations plane
From MaRDI portal
Publication:734853
DOI10.1016/j.amc.2009.06.023zbMath1176.65017MaRDI QIDQ734853
Kristian Sabo, Rudolf Scitovski, Ratko Grbić, Robert Cupec
Publication date: 14 October 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.06.023
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
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, One-dimensional center-based l 1-clustering method, Weighted Median of the Data in Solving Least Absolute Deviations Problems
Uses Software
Cites Work
- Weighted median algorithms for \(L_ 1\) approximation
- On orthogonal linear \(\ell_1\) approximation
- Locating lines and hyperplanes. Theory and algorithms
- Approximating surfaces by moving total least squares method
- Anchored hyperplane location problems
- Properties of three-dimensional median line location models
- Direct search methods: Then and now
- Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
- On the Gauss-Newton method for l1 orthogonal distance regression
- A new descent algorithm for the least absolute value regression problem
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Least‐squares problems for Michaelis–Menten kinetics
- THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
