Three points method for searching the best least absolute deviations plane
From MaRDI portal
Publication:734853
DOI10.1016/J.AMC.2009.06.023zbMATH Open1176.65017OpenAlexW2015653412MaRDI QIDQ734853FDOQ734853
Robert Cupec, Kristian Sabo, Ratko Grbić, Rudolf Scitovski
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
Recommendations
- 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Approximating surfaces by moving total least squares method
- Direct search methods: Then and now
- Locating lines and hyperplanes. Theory and algorithms
- Title not available (Why is that?)
- Least‐squares problems for Michaelis–Menten kinetics
- Weighted median algorithms for \(L_ 1\) approximation
- Anchored hyperplane location problems
- Title not available (Why is that?)
- THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
- On orthogonal linear \(\ell_1\) approximation
- Properties of three-dimensional median line location models
- Title not available (Why is that?)
- Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models
- Title not available (Why is that?)
- On the Gauss-Newton method for l1 orthogonal distance regression
- A new descent algorithm for the least absolute value regression problem
Cited In (10)
- A three point formula for finding roots of equations by the method of least squares
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Fitting a Line to Three or Four Points on a Plane
- One-dimensional center-based l 1-clustering method
- Application of growth functions in the prediction of live weight of domestic animals
- Center-based l1–clustering method
- 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
- Least absolute deviations problem for the Michaelis-Menten function
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
- Data clustering for circle detection
Uses Software
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)