A New Algorithm for the Least Absolute Deviation Regression Based on the Simulated Annealing Algorithm
Fuchang Wang
Abstract
Fuchang Wang
Abstract
The least absolute deviation criteria is widely used in engineering because of its robustness, but the algorithms for solving the least absolute deviation estimate of the regression coefficient are too explicated or only efficient for small sample points and variables. In this paper, a new method based on simulated annealing algorithm to solve the least absolute deviation estimates of regression coefficient is presented by changing the problem to the combinatorial optimization based on it's properties. At last the numerical experimentations verified the validity of the new method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The least absolute deviation criteria is widely used in engineering because of its robustness, but the algorithms for solving the least absolute deviation estimate of the regression coefficient are too explicated or only efficient for small sample points and variables. In this paper, a new method based on simulated annealing algorithm to solve the least absolute deviation estimates of regression coefficient is presented by changing the problem to the combinatorial optimization based on it's properties. At last the numerical experimentations verified the validity of the new method.
Key concepts: Least absolute deviations, Absolute deviation, Simulated annealing, Algorithm, Standard deviation, Robustness (evolution), Relative standard deviation, Mean absolute error