Three points method for searching the best least absolute deviations plane
A new method for estimating optimal parameters of a best least absolute deviations (LAD) plane is proposed, which is based on the fact that there always exists a best LAD plane passing through at least three different data points. A modification to the foregoing method is also proposed, that is especially adjusted to the case of a large number of data and the need to estimate parameters in real time [cf. \textit{M. A. Fischler} et al., Graphics Image Process. 24, 381--395 (1981)]. These methods are illustrated and tested on several numerical examples.
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- scientific article; zbMATH DE number 1008711
- Fitting a Line to Three or Four Points on a Plane
- Least Absolute Regression Revisited
- 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
- A new descent algorithm for the least absolute value regression problem
- Anchored hyperplane location problems
- Approximating surfaces by moving total least squares method
- Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
- Direct search methods: Then and now
- scientific article; zbMATH DE number 431989 (Why is no real title available?)
- scientific article; zbMATH DE number 3852235 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 41732 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Least‐squares problems for Michaelis–Menten kinetics
- Locating lines and hyperplanes. Theory and algorithms
- On orthogonal linear \(\ell_1\) approximation
- On the Gauss-Newton method for l1 orthogonal distance regression
- Properties of three-dimensional median line location models
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Weighted median algorithms for \(L_ 1\) approximation
- One-dimensional center-based l 1-clustering method
- A three point formula for finding roots of equations by the method of least squares
- Data clustering for circle detection
- Least absolute deviations problem for the Michaelis-Menten function
- Application of growth functions in the prediction of live weight of domestic animals
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
- scientific article; zbMATH DE number 1323071 (Why is no real title available?)
- scientific article; zbMATH DE number 1008711 (Why is no real title available?)
- Fitting a Line to Three or Four Points on a Plane
- Center-based l₁-clustering method
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- 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
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
This page was built for publication: Three points method for searching the best least absolute deviations plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734853)
