An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
| Autor: | I. Barrodale, F. D. K. Roberts |
|---|---|
| Rok vydání: | 1978 |
| Předmět: |
Discrete mathematics
Numerical Analysis Linear programming Efficient algorithm Applied Mathematics Big M method Type (model theory) Computational Mathematics Simplex algorithm Applied mathematics Criss-cross algorithm Quantum algorithm for linear systems of equations Linear approximation Mathematics |
| Zdroj: | SIAM Journal on Numerical Analysis. 15:603-611 |
| ISSN: | 1095-7170 0036-1429 |
| DOI: | 10.1137/0715040 |
| Popis: | We describe an algorithm, based on the simplex method of linear programming, for solving the discrete $l_1$ approximation problem with any type of linear constraints. The numerical results reported here, combined with the fact that in the absence of constraints the present algorithm reduces to our earlier unconstrained $l_1$ algorithm, indicate that this algorithm is very efficient. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|