Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes (Q581249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes |
scientific article; zbMATH DE number 4018787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes |
scientific article; zbMATH DE number 4018787 |
Statements
Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes (English)
0 references
1987
0 references
This paper presents the methodology and results of a computational experiment which compares the performance of four computer codes which determine the best discrete \(L_ 1\) approximation to a continuous nonlinear function. The experiment utilizes 320 test problems created by a test problem generator. Several performance measures describe solution quality as well as computational effort.
0 references
computational experiment
0 references
best discrete \(L_ 1\) approximation
0 references
performance measures
0 references
0 references
0 references
