On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians (Q1096541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians |
scientific article; zbMATH DE number 4031394 |
Statements
On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians (English)
0 references
1987
0 references
The work of Edgeworth in the 1880's gave the first systematic methods for solving the linear discrete \(L_ 1\) approximation. Wagner in 1959 showed that the linear discrete \(L_ 1\) approximation problem could be formulated as a linear programming problem. Recent improvements in linear programming based methods have been concerned with modifying the simplex method to accelerate the calculation of the optimal solution. This paper shows how the method of vanishing Jacobians which has been used to optimize quadratic programming problems can also be used to solve the special linear programming problem associated with computing the linear discrete \(L_ 1\) approximation.
0 references
least absolute value
0 references
linear discrete \(L_ 1\) approximation
0 references
method of vanishing Jacobians
0 references
0 references
0.8388175964355469
0 references
0.8061308264732361
0 references
0.7727934718132019
0 references
