×

Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes. (English) Zbl 0626.90075

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.

MSC:

90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
65D15 Algorithms for approximation of functions
Full Text: DOI

References:

[1] Dembo, R. S.; Mulvey, J. M., On the analysis and comparison of mathematical programming techniques, (White, W. W., Computers and Mathematical Programming, Vol. 502 (1978), National Bureau of Standards Special Publication), 106-116 · Zbl 0423.90041
[2] Gilsinn, J.; Hoffman, K.; Jackson, R. H.F.; Leyendecker, E.; Saunders, P.; Shier, D., Methodology and analysis for comparing discrete linear \(L_1\) approximation codes, Commun. Statist., B6, 399-413 (1977)
[3] Gentle, J. E., Least absolute values estimation: an introduction, Commun. Statist., B6, 313-328 (1977) · Zbl 0383.62046
[4] Rice, J. R.; White, J. S., Norms for smoothing and estimation, SIAM Rev., 6, 243-256 (1964) · Zbl 0121.34102
[5] Hampel, F. R., A general qualitative definition of robustness, Ann. Mathemat. Statist., 42, 1887-1896 (1971) · Zbl 0229.62041
[6] Harter, H. L., Nonuniqueness of least absolute values regression, Commun. Statist., A6, 829-838 (1977) · Zbl 0364.62050
[7] Davis, P. J., Interpolation and Approximation (1965), Blaisdell: Blaisdell New York · Zbl 0111.06003
[8] Rice, J. R., The Approximation of Functions (1964), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0114.27001
[9] Timan, A. F., Theory of Approximation of Functions of a Real Variable (1963), Macmillan: Macmillan New York, (Translated by J. Barry) · Zbl 0117.29001
[10] Forsythe, G. E., Generation and use of orthogonal polynomials for data-fitting with a digital computer, SIAM J., 5, 74-88 (1957) · Zbl 0083.35503
[11] Shier, D. R.; Neupauer, S. J.; Saunders, P. B., A collection of test problems for discrete linear \(L_1\) data fitting, National Bureau of Standards Internal Report NBSIR 79-1920 (November 1979)
[12] Appa, G.; Smith, C., On \(L_1\) and Chebyshev estimation, Mathemat. Programmg, 5, 73-87 (1973) · Zbl 0271.41021
[13] Barrodale, I.; Roberts, F. D.K., An improved algorithm for discrete \(L_1\) linear approximation, SIAM J. Numer. Anal., 10, 839-848 (1973) · Zbl 0266.65016
[14] Gentle, J. E.; Kennedy, W. J.; Sposito, V. A., On least absolute values estimation, Commun. Statist., A6, 839-845 (1977) · Zbl 0366.62090
[15] Abdelmalek, N. N., An efficient method for the discrete linear \(L_1\) approximation problem, Mathemat. Computn, 29, 844-850 (1975) · Zbl 0307.65052
[16] Armstrong, R. D.; Frome, E. L., A comparison of two algorithms for absolute deviation curve fitting, J. Am. statist. Ass., 71, 328-330 (1976) · Zbl 0344.62055
[17] Barrodale, I.; Roberts, F. D.K., Solution of an overdetermined system of equations in the \(L_1\) norm, Commun. Ass. Computg Machin., 17, 319-320 (1974)
[18] Bartels, R. H.; Conn, A. R.; Sinclair, J. W., Minimization techniques for piecewise differentiable functions: the \(L_1\) solution to an overdetermined linear system, SIAM J. Numer. Anal., 15, 224-241 (1978) · Zbl 0376.65018
[19] Hoffman, K.; Shier, D., A test problem generator for discrete linear \(L_1\) approximation problems, ACM Transact. Mathemat. Software, 6, 587-593 (1980) · Zbl 0445.41006
[20] Domich, P.; Lawrence, J.; Shier, D., Generators for discrete polynomial \(L_1\) approximation problems, J. Res. natn. Bur. Stand., 84, 455-488 (1979) · Zbl 0437.65014
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.