Approximation in normed linear spaces

Journal of Computational and Applied Mathematics

Volumn 121, Issue 1, 2000, Pages 1-36

  Watson, G A ^a  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; FUNCTIONS; PROBLEM SOLVING;

NORMED LINEAR SPACES;

LINEAR EQUATIONS;

EID: 0034274694     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00333-2     Document Type: Article

References (212)

1. N.N. Abdelmalik, Linear L1 approximation for a discrete point set and L1 solutions of overdetermined linear equations, J. Assoc. Comput. Mach. 18 (1971) 41-47.
2. N.N. Abdelmalik, An efficient method for the discrete linear L1 approximation problem, Math. Comp. 29 (1975) 844-850.
3. N.I. Achieser, Theory of Approximation, Ungar, New York, 1956.
4. D.H. Anderson, M.R. Osborne, Discrete, nonlinear approximation problems in polyhedral norms, Numer. Math. 28 (1977) 143-156.
5. D.O. Andreassen, G.A. Watson, Linear Chebyshev approximation without Chebyshev sets, BIT 16 (1976) 349-362.
6. R.D. Armstrong, J. Godfrey, Two linear programming algorithms for the linear discrete L1 norm problem, Math. Comp. 33 (1979) 289-300.
7. R.D. Armstrong, D.S. Kung, A dual method for discrete Chebyshev curve fitting, Math. Programming 19 (1979) 186-199.
8. I. Barrodale, C. Phillips, Algorithm 495: solution of an overdetermined system of linear equations in the Chebyshev norm, ACM Trans. Math. Software 1 (1975) 264-270.
9. I. Barrodale, M.J.D. Powell, F.D.K. Roberts, The differential correction algorithm for rational lα approximation, SIAM J. Numer. Anal. 9 (1972) 493-504.
10. I. Barrodale, F.D.K. Roberts, Applications of mathematical programming to lp approximation, in: J.B. Rosen, O.L. Mangasarian, K. Ritter (Eds.), Nonlinear Programming, Academic Press, New York, 1970, pp. 447-464.
11. I. Barrodale, F.D.K. Roberts, An improved algorithm for discrete l1 linear approximation, SIAM J. Numer. Anal. 10 (1973) 839-848.
12. I. Barrodale, F.D.K. Roberts, Algorithm 478: solution of an overdetermined system of equations in the L1 norm, Comm. ACM 17 (1974) 319-320.
13. I. Barrodale, A. Young, Algorithms for best L1 and Lα linear approximation on a discrete set, Numer. Math. 8 (1966) 295-306.
14. I. Barrodale, A. Young, A note on numerical procedures for approximation by spline functions, Comput. J. 9 (1966) 318-320.
15. R. Bartels, A.R. Conn, An approach to nonlinear l1 data fitting, in: J.P. Hennart (Ed.), Numerical Analysis, Cocoyoc, 1981, Springer, Berlin, 1982, pp. 48-58.
16. R. Bartels, A.R. Conn, C. Charalambous, On Cline's direct method for solving overdetermined linear systems in the lα sense, SIAM J. Numer. Anal. 15 (1978) 255-270.
17. R. Bartels, A.R. Conn, Y. Li, Primal methods are better than dual methods for solving overdetermined linear systems in the lα sense, SIAM J. Numer. Anal. 26 (1989) 693-726.
18. R. Bartels, A.R. Conn, J.W. Sinclair, Minimization techniques for piecewise differentiable functions: the l1 solution to an overdetermined linear system, SIAM J. Numer. Anal. 15 (1978) 224-241.
19. R. Bartels, G.H. Golub, Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations, Comm. ACM. 11 (1968) 401-406.
20. A.E. Beaton, J.W. Tukey, The fitting of power series, meaning polynomials, illustrated on band-spectrographic data, Technometrics 16 (1974) 147-185.
21. R. Bellmann, Methods of Nonlinear Analysis I, Academic Press, New York, 1970.
22. D. Belogus, N. Liron, DCR2: an improved algorithm for lα rational approximation, Numer. Math. 31 (1978) 17-29.
23. S.N. Bernstein, Lecons sur les Propriétés Extrémales et la Meillure Approximation des Fonctions Analytiques d'une Variable Réelle, Gauthier-Villars, Paris, 1926.
24. L. Bittner, Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfullter Haarscher Bedingung, Z. Angew. Math. Mech. 41 (1961) 238-256.
25. H.-P. Blatt, Exchange algorithms, error estimates and strong unicity in convex programming and Chebyshev approximation, in: S.P. Singh, J.W.H. Burry, B. Watson (Eds.), Approximation Theory and Spline Functions, Reidel, Dodrecht, 1984, pp. 1-41.
26. P. Bloomfield, W.L. Steiger, Least Absolute Deviations, Birkhaüser, Boston, 1983.
27. P.T. Boggs, A new algorithm for the Chebyshev solution of overdetermined linear systems, Math. Comp. 28 (1974) 203-217.
28. E. Borel, Lecons sur les Fonctions de Variables Reélles, Gauthier-Villars, Paris, 1905.
29. D. Braess, Approximation mit Exponentialsummen, Computing 2 (1967) 309-321.
30. D. Braess, Chebyshev approximation by spline functions with free knots, Numer. Math. 17 (1971) 357-366.
31. D. Braess, Geometrical characterization for nonlinear uniform approximation, J. Approx. Theory 11 (1974) 260-274.
32. P.T. Breuer, A new method for real rational uniform approximation, in: J.C. Mason, M.G. Cox (Eds.), Algorithms for Approximation, Clarendon Press, Oxford, 1987, pp. 265-283.
33. P. Butzer, F. Jongmans, P.L. Chebyshev (1821-1894). A guide to his life and work, J. Approx. Theory 96 (1999) 11-138.
34. C. Carasso, P.J. Laurent, An algorithm of successive minimization in convex programming, R. A. I. R. O. Numer. Anal. 12 (1978) 377-400.
35. A. Charnes, W.W. Cooper, R.O. Ferguson, Optimal estimation of executive compensation by linear programming, Management Sci. 1 (1955) 138-151.
36. P.L. Chebyshev, Sur les questions de minima qui se rattachent à la representation approximative des fonctions, Oeuvres I (1859) 273-378.
37. E.W. Cheney, A.A. Goldstein, Newton's method for convex programming and Tchebycheff approximation, Numer. Math. 1 (1959) 253-268.
38. E.W. Cheney, H.L. Loeb, Two new algorithms for rational approximation, Numer. Math. 3 (1961) 72-75.
39. E.W. Cheney, H.L. Loeb, On rational Chebyshev approximation, Num. Math. 4 (1962) 124-127.
40. E.W. Cheney, H.L. Loeb, Generalized rational approximation, SIAM J. on Num. Anal. 1 (1964) 11-25.
41. E.W. Cheney, M.J.D. Powell, The differential correction algorithm for generalized rational functions, Constr. Approx. 3 (1987) 249-256.
42. E.W. Cheney, T.H. Southard, A survey of methods for rational approximation, with particular reference to a new method based on a formula of Darboux, SIAM Rev. 5 (1963) 219-231.
43. J.F. Claerbout, F. Muir, Robust modelling with erratic data, Geophysics 38 (1973) 826-844.
44. D.I. Clark, The mathematical structure of Huber's M-estimator, SIAM J. Sci. Statist. Comput. 6 (1985) 209-219.
45. A.K. Cline, A descent method for the uniform solution to overdetermined systems of linear equations, SIAM J. Numer. Anal. 13 (1976) 293-309.
46. T.F. Coleman, Y. Li, A globally and quadratically convergent affine scaling algorithm for l1 problems, Math. Programming 56 (1992) 189-222.
47. T.F. Coleman, Y. Li, A globally and quadratically convergent method for linear lα problems, SIAM J. Numer. Anal. 29 (1992) 1166-1186.
48. A.R. Conn, An efficient second order method to solve the (constrained) minimax problem, Report CORR 79-5, University of Waterloo, 1979.
49. A.R. Conn, Y. Li, An efficient algorithm for nonlinear minimax problems, Research Report CS-88-41, University of Waterloo, 1989.
50. L. Cromme, Eine Klasse von Verfahren zur Ermittlung bester nichtlinearen Tschebyscheff-Approximationen, Numer. Math. 25 (1976) 447-459.
51. L. Cromme, Strong uniqueness: a far reaching criterion for the convergence of iterative processes, Numer. Math. 29 (1978) 179-193.
52. A.R. Curtis, M.R. Osborne, The construction of minimax rational approximations to functions, Comput. J. 9 (1966) 286-293.
53. M. Davies, Linear approximation using the criterion of least total deviations, J. Roy. Statist. Soc. Ser. B 29 (1967) 101-109.
54. J. Descloux, Approximations in Lp and Chebyshev approximations, SIAM J. 11 (1963) 1017-1026.
55. S.N. Dua, H.L. Loeb, Further remarks on the differential correction algorithm, SIAM J. Numer. Anal. 10 (1973) 123-126.
56. A.M. Duarte, R.J. Vanderbei, Interior point algorithms for lsad and lmad estimation, Technical Report SOR-94-07, Programs in Operations Research and Statistics, Princeton University, 1994.
57. C.B. Dunham, Chebyshev approximation by exponential-polynomial sums, J. Comput. Appl. Math. 5 (1979) 53-57.
58. C.B. Dunham, The weakened first algorithm of Remes, J. Approx. Theory 31 (1981) 97-98.
59. C.B. Dunham, Approximation with one (or few) parameters nonlinear, J. Comput. Appl. Math. 21 (1988) 115-118.
60. R. Dutter, Robust regression: different approaches to numerical solutions and algorithms, Research Report No 6, Technische Hochschule, Zurich, 1975.
61. F.Y. Edgeworth, On a new method of reducing observations relating to several quantities, Philos. Mag. 5 (1888) 185-191.
62. R.E. Esch, W.L. Eastman, Computational methods for best spline function approximation, J. Approx. Theory 2 (1969) 85-96.
63. R.W. Farebrother, The historical development of the L1 and Lα estimation procedures 1793-1930, in: Y. Dodge (Ed.), Statistical Data Analysis Based on the L1 Norm and Related Methods, North-Holland, Amsterdam, 1987, pp. 37-63.
64. R.W. Farebrother, Fitting Linear Relationships: A History of the Calculus of Observations 1750-1900, Springer, Berlin, 1999.
65. J. Fischer, The convergence of the best discrete linear Lp approximation as p → 1, J. Approx. Theory 39 (1983) 374-385.
66. W.D. Fisher, A note on curve fitting with minimum deviations by linear programming, J. Amer. Statist. Assoc. 56 (1961) 359-362.
67. R. Fletcher, Numerical experiments with an exact l1 penalty function method, in: O.L. Mangasarian, R.R. Meyer, S.M. Robinson (Eds.), Nonlinear Programming 4, Academic Press, New York, 1981, pp. 99-129.
68. R. Fletcher, An l1 penalty method for nonlinear constraints, in: P.T. Boggs, R.H. Byrd, R.B. Schnabel (Eds.), Numerical Optimization 1984, SIAM Publications, Philadelphia, 1985, pp. 26-40.
69. R. Fletcher, J.A. Grant, M.D. Hebden, Minimax approximation as the limit of best Lp approximation, SIAM J. Numer. Anal. 11 (1974) 123-136.
70. W. Fraser, J.F. Hart, On the computation of rational approximations to continuous functions, Comm. ACM 5 (1962) 401-403.
71. K. George, M.R. Osborne, The efficient computation of linear rank statistics, J. Comput. Simul. 35 (1990) 227-237.
72. K. Glashoff, R. Schultz, Uber die genaue Berechnung von besten L1-Approximierenden, J. Approx. Theory 25 (1979) 280-293.
73. G.H. Golub, L.B. Smith, Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system, Comm. ACM 14 (1971) 737-746.
74. S. Görner, Ein Hybridverfahren zur Losung nichtlinearer semi-infiniter Optimierungsprobleme, Ph.D. Thesis, Technical University of Berlin, 1997.
75. M. Gugat, An algorithm for Chebyshev approximation by rationals with constrained denominators, Constr. Approx. 12 (1996) 197-221.
76. M. Gugat, The Newton differential correction algorithm for uniform rational approximation with constrained denominators, Numer. Algorithms 13 (1996) 107-122.
77. S.-A. Gustafson, On the computational solution of a class of generalized moment problems, SIAM J. Numer. Anal. 7 (1970) 343-357.
78. S.-A. Gustafson, K. Kortanek, Numerical treatment of a class of semi-infinite programming problems, Naval. Res. Logist. Quart. 20 (1973) 477-504.
79. A. Haar, Die Minkowskische Geometrie und die Annaherung an stetige Funktionen, Math. Ann. 78 (1918) 294-311.
80. J. Hald, K. Madsen, A two-stage algorithm for minimax optimization, in: A. Bensoussan, J. Lions (Eds.), International Symposium on Systems Optimization and Analysis, Springer, Berlin, 1979, pp. 225-239.
81. J. Hald, K. Madsen, Combined LP and quasi-Newton methods for nonlinear l1 optimization, SIAM J. Numer. Anal. 22 (1985) 68-80.
82. S.-P. Han, Variable metric methods for minimizing a class of nondifferentiable functions, Math. Prog. 20 (1981) 1-13.
83. R. Hettich, A Newton method for nonlinear Chebyshev approximation, in: R. Schaback, K. Scherer (Eds.), Approximation Theory, Springer, Berlin, 1976, pp. 222-236.
84. R. Hettich, Numerical methods for nonlinear Chebyshev approximation in: G. Meinardus (Ed.), Approximation in Theorie und Praxis, B.I.-Wissenschaftsverlag, Mannheim, 1979, pp. 139-156.
85. R. Hettich, An implementation of a discretization method for semi-infinite programming, Math. Programming 34 (1986) 354-361.
86. R. Hettich, P. Zenke, An algorithm for general restricted rational Chebyshev approximation, SIAM J. Numer. Anal. 27 (1990) 1024-1033.
87. C.R. Hobby, J.R. Rice, A moment problem in L1-approximation, Proc. Amer. Math. Soc. 65 (1965) 665-670.
88. C.R. Hobby, J.R. Rice, Approximation from a curve of functions, Arch. Rational Mech. Anal. 27 (1967) 91-106.
89. P.G. Hoel, Certain problems in the theory of closest approximation, Amer. J. Math. 57 (1935) 891-901.
90. M.J. Hopper, M.J.D. Powell, A technique that gains speed and accuracy in the minimax solution of overdetermined linear equations, in: J.R. Rice (Ed.), Mathematical Software III, Academic Press, New York, 1977.
91. Y. Ishizaki, H. Watanabe, An iterative Chebyshev approximation method for network design, IEEE Trans. Circuit Theory 15 (1968) 326-336.
92. D. Jackson, Note on a class of polynomials of approximation, Trans. Amer. Math. Soc. 13 (1921) 320-326.
93. R.C. James, Orthogonality and linear functionals in normed linear spaces, Trans. Amer. Math. Soc. 61 (1947) 265-292.
94. Z. Jing, A.T. Fam, An algorithm for computing continuous Chebyshev approximations, Math. Comp. 48 (1987) 691-710.
95. K. Jittorntrum, M.R. Osborne, Strong uniqueness and second order convergence in nonlinear discrete approximation, Numer. Math. 34 (1980) 439-455.
96. R.S. Johnson, On monosplines of least deviation, Trans. Amer. Math. Soc. 96 (1960) 458-477.
97. K. Jonasson, A projected conjugate gradient method for sparse minimax problems, Numer. Algorithms 5 (1993) 309-323.
98. K. Jonasson, K. Madsen, Corrected sequential linear programming for sparse minimax optimization, BIT 34 (1994) 372-387.
99. K. Jonasson, G.A. Watson, A Lagrangian method for multivariate continuous Chebyshev approximation problems, in: W. Schempp, K. Zeller (Eds.), Multivariate Approximation Theory 2, I.S.N.M. 61, Birkhaüser, Basel, 1982, pp. 211-221.
100. R.C. Jones, L.A. Karlovitz, Equioscillation under nonuniqueness in the approximation of continuous functions, J. Approx. Theory 3 (1970) 138-145.
101. D.W. Kammler, Chebyshev approximation of completely monotonic functions by sums of exponentials, SIAM J. Numer. Anal. 13 (1976) 761-774.
102. N. Karmarker, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
103. E.H. Kaufmann, D.J. Leeming, G.D. Taylor, A combined Remes-Differential Correction algorithm for rational approximation, Math. Comp. 32 (1978) 233-242.
104. E.H. Kaufmann, G.D. Taylor, Uniform approximation by rational functions having restricted denominators, J. Approx. Theory 32 (1981) 9-26.
105. J.E. Kelley Jr., An application of linear programming to curve fitting, SIAM J. 6 (1958) 15-22.
106. P. Kirchberger, Uber Tchebychefsche Annaherungsmethoden, Math. Ann. 57 (1903) 509-540.
107. P. Laasonen, Einige Satze uber Tschebyscheffsche Funktionensysteme, Ann. Acad. Sci. Fenn. Ser. AI 52 (1949) 3-24.
108. E. Laguerre, Ouvres I, Gauthier-Villars, Paris, 1898.
109. D. Landers, L. Rogge, Natural choice of L1-Approximants, J. Approx. Theory 33 (1981) 268-280.
110. P.S. Laplace, Mechanique Celeste, Tome 111, No 39, 1799.
111. C.L. Lawson, Contributions to the Theory of Linear Least Maximum Approximation, Ph.D. Dissertation, University of California, Los Angeles, 1961.
112. C.L. Lawson, Characteristic properties of the segmented rational minimax approximation problem, Num. Math. 6 (1964) 293-301.
113. W. Li, J.J. Swetits, The linear l1 estimator and Huber M-estimator, SIAM J. on Optim. 8 (1998) 457-475.
114. Y. Li, A globally convergent method for Lp problems, SIAM J. Optim. 3 (1993) 609-629.
115. K. Madsen, An algorithm for minimax solution of over-determined systems of non-linear equations, J. Inst. Math. Appl. 16 (1975) 321-328.
116. K. Madsen, H.B. Neilsen, A finite smoothing algorithm for linear l1 estimation, SIAM J. Optim. 3 (1993) 223-235.
117. K. Madsen, H.B. Nielson, M.C. Pinar, New characterizations of l1 solutions of overdetermined linear systems, Operations Research Letters 16 (1994) 159-166.
118. H.J. Maehly, Methods of fitting rational approximations, Part II, J. Assoc. Comput. Mach. 10 (1963) 257-266.
119. J.C. Mairhuber, On Haar's theorem concerning Chebyshev approximation problems having unique solutions, Proc. Amer. Math. Soc. 7 (1956) 609-615.
120. J.T. Marti, A method for the numerical computation of best L1 approximations of continuous functions, Proceedings of Oberwolfach Conference, ISNM, Vol. 26, Birkhauser, Basel, 1975.
121. H.W. McLaughlin, J.J. Zacharski, Segmented approximation, in: E.W. Cheney (Ed.), Approximation Theory III, Academic Press, New York, 1980, pp. 647-654.
122. R.A. McLean, G.A. Watson, Numerical methods for nonlinear discrete L1 approximation problems, Proceedings of Oberwolfach Conference on Numerical Methods in Approximation Theory 1979, ISNM, Vol. 52, Birkhauser, Basel, 1980.
123. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim. 2 (1992) 575-601.
124. G. Meinardus, G. Nürnberger, M. Sommer, H. Strauss, Algorithms for piecewise polynomials and splines with free knots, Math. Comp. 53 (1989) 235-247.
125. G. Meinardus, G. Nürnberger, G. Walz, Bivariate segment approximation and splines, Adv. Comput. Math. 6 (1996) 25-45.
126. G. Meinardus, D. Schwedt, Nicht-lineare Approximationen, Arch. Rational Mech. Anal. 17 (1964) 297-326.
127. M.S. Meketon, Least absolute value regression, Technical Report, AT&T Bell Laboratories, Murray Hill, New Jersey, 1987.
128. G. Merle, H. Späth, Computational experience with discrete Lp approximation, Computing 12 (1974) 315-321.
129. C.A. Micchelli, Best L1 approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines, J. Approx. Theory 19 (1977) 1-14.
130. T.S. Motzkin, Approximation by curves of a unisolvent family, Bull. Amer. Math. Soc. 55 (1949) 789-793.
131. T.S. Motzkin, J.L. Walsh, Least pth power polynomials on a real finite point set, Trans. Amer. Math. Soc. 78 (1955) 67-81.
132. T.S. Motzkin, J.L. Walsh, Least pth power polynomials on a finite point set, Trans. Amer. Math. Soc. 83 (1956) 371-396.
133. D.G. Moursund, Optimal starting values for Newton-Raphson calculation of √x, Comm. ACM 10 (1967) 430-432.
134. B. Mulansky, Chebyshev approximation by spline functions with free knots, IMA J. Numer. Anal. 12 (1992) 95-105.
135. W. Murray, M.L. Overton, A projected Lagrangian algorithm for nonlinear minimax optimization, SIAM J. Sci. Statist. Comput. 1 (1980) 345-370.
136. W. Murray, M.L. Overton, A projected Lagrangian algorithm for nonlinear l1 optimization, SIAM J. Sci. Statist. Comput. 2 (1981) 207-214.
137. G. Nürnberger, Strongly unique spline approximation with free knots, Constr. Approx. 3 (1987) 31-42.
138. G. Nürnberger, Approximation by univariate and bivariate splines, in: D. Bainov, V. Covachev (Eds.), Second International Colloquium on Numerical Analysis, VSP, Utrecht, 1994, pp. 143-153.
139. G. Nürnberger, Bivariate segment approximation and free knot splines: research problems 96-4, Constr. Approx. 12 (1996) 555-558.
140. G. Nürnberger, Optimal partitions in bivariate segment approximation, in: A. Le Méhauté, C. Rabut, L.L. Schumaker (Eds.), Surface Fitting and Multiresolution Methods, Vanderbilt University Press, Nashville, 1997, pp. 271-278.
141. G. Nürnberger, L.L. Schumaker, M. Sommer, H. Strauss, Approximation by generalized splines, J. Math. Anal. Appl. 108 (1985) 466-494.
142. G. Nürnberger, L.L. Schumaker, M. Sommer, H. Strauss, Uniform approximation by generalized splines with free knots, J. Approx. Theory 59 (1989) 150-169.
143. G. Nürnberger, I. Singer, Uniqueness and strong uniqueness of best approximations by spline subspaces and other spaces, J. Math. Anal. Appl. 90 (1982) 171-184.
144. G. Nürnberger, M. Sommer, A Remez type algorithm for spline functions, Numer. Math. 41 (1983) 117-146.
145. G. Nürnberger, M. Sommer, H. Strauss, An algorithm for segment approximation, Numer. Math. 48 (1986) 463-477.
146. M.R. Osborne, An algorithm for discrete, nonlinear best approximation problems, Proceedings of Oberwolfach Conference on ISNM, Vol. 16, Birkhauser, Basel, 1971.
147. M.R. Osborne, Finite Algorithms in Optimisation and Data Analysis, Wiley, Chichester, 1985.
148. M.R. Osborne, The reduced gradient algorithm, in: Y. Dodge (Ed.), Statistical Data Analysis Based on the L1 Norm and Related Methods, North-Holland, Amsterdam, 1987, pp. 95-107.
149. M.R. Osborne, G.A. Watson, On the best linear Chebyshev approximation, Comput. J. 10 (1967) 172-177.
150. M.R. Osborne, G.A. Watson, An algorithm for minimax approximation in the nonlinear case, Comput. J. 12 (1969) 63-68.
151. M.R. Osborne, G.A. Watson, A note on singular minimax approximation problems, J. Math. Anal. Appl. 25 (1969) 692-700.
152. M.R. Osborne, G.A. Watson, On an algorithm for discrete nonlinear L1 approximation, Comput. J. 14 (1971) 184-188.
153. M.R. Osborne, G.A. Watson, Nonlinear approximation problems in vector norms, in: G.A. Watson (Ed.), Proceedings of Dundee Numerical Analysis Conference, Springer, Berlin, 1978.
154. M.R. Osborne, G.A. Watson, Aspects of M-estimation and l1 fitting problems, in: D.F. Griffiths, G.A. Watson (Eds.), Numerical Analysis: A R Mitchell 75th Birthday Volume, World Scientific Publishing Co, Singapore, 1996, pp. 247-261.
155. T. Pavlidis, A.P. Maika, Uniform piecewise polynomial approximation with variable joints, J. Approx. Theory 12 (1974) 61-69.
156. G. Polya, Sur une algorithme toujours convergent pour obtenir les polynomes de meillure approximation de Tchebysheff pour une fonction continue quelconque, Comptes Rendues 157 (1913) 840-843.
157. S. Portnoy, R. Koenker, The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators, Statist. Sci. 12 (1997) 279-296.
158. M.J.D. Powell, Approximation Theory and Methods, Cambridge University Press, Cambridge, 1980.
159. C.J. Price, I.D. Coope, Numerical experiments in semi-infinite programming problems, Comput. Optim. Appl. 6 (1996) 169-189.
160. A. Ralston, Rational Chebyshev approximation by Remes algorithms, Numer. Math. 7 (1965) 322-330.
161. A. Ralston, Some aspects of degeneracy in rational approximation, JIMA 11 (1973) 157-170.
162. R. Reemtsen, Modifications of the first Remez algorithm, SIAM J. Numer. Anal. 27 (1990) 507-518.
163. R. Reemtsen, Discretization methods for the solution of semi-infinite programming problems, J. Optim. Theory Appl. 71 (1991) 85-103.
164. R. Reemtsen, S. Görner, Numerical methods for semi-infinite programming: a survey, in: R. Reemtsen, J.-J. Ruckman (Eds.), Semi-Infinite Programming, Kluwer Academic Publishers, Boston, 1998, pp. 195-275.
165. E.YA. Remes, Sur un procédé convergent d'approximation sucessives pour déterminer les polynomes d'approximation, Comptes Rendues 198 (1934) 2063-2065.
166. E.YA. Remes, Sur le calcul effectif des polynomes d'approximation de Tchebichef, Comptes Rendues 199 (1934) 337-340.
167. E.C. Rhodes, Reducing observations by the method of minimum deviations, Philos. Mag. 9 (1930) 974-992.
168. J.R. Rice, The characterization of best nonlinear Tchebycheff approximation, Trans. Amer. Math. Soc. 96 (1960) 322-340.
169. x + c, J. SIAM 10 (1960) 691-702.
170. J.R. Rice, Tchebycheff approximation by functions unisolvent of variable degree, Trans. Amer. Math. Soc. 99 (1961) 298-302.
171. J.R. Rice, Chebyshev approximation by exponentials, J. SIAM 10 (1962) 149-161.
172. J.R. Rice, The Approximation of Functions, Vol. I, Addison-Wesley, Reading, MA, 1964.
173. J.R. Rice, Characterization of Chebyshev approximation by splines, SIAM J. Math. Anal. 4 (1967) 557-567.
174. F. Riesz, Uber lineare Funktionalgleichungen, Acta. Math. 41 (1918) 71-98.
175. P.D. Robers, A. Ben-Israel, An interval programming algorithm for discrete linear L1 approximation problems, J. Approx. Theory 2 (1969) 323-331.
176. P.D. Robers, S.S. Robers, Algorithm 458: discrete linear L1 approximation by interval linear programming, Comm. ACM 16 (1973) 629-631.
177. H. Robitzsch, R. Schaback, Die numerische Berechnung von Startnaherungen bei der Exponentialapproximation, in: L. Collatz, G. Meinardus, H. Werner (Eds.), Numerical Methods of Approximation Theory, ISNM, Vol. 42, Birkhauser, Basel, 1978, pp. 260-280.
178. S.A. Ruzinsky, E.T. Olsen, l1 and lα minimization via a variant of Karmarkar's algorithm, IEEE Trans. Acoust. Speech Signal Process. 37 (1989) 245-253.
179. R. Schaback, Suboptimal exponential approximation, Report Nr 23, University of Gottingen, 1979.
180. L.L. Schumaker, Uniform approximation by Tchebycheffian spline functions, J. Math. Mech. 18 (1968) 369-378.
181. L.L. Schumaker, Some algorithms for the computation of interpolating and approximating spline functions, in: T.N.E. Greville (Ed.), Theory and Applications of Spline Functions, Academic Press, New York, 1969, pp. 87-102.
182. R.R. Singleton, A method for minimizing the sum of absolute values of deviations, Ann. Math. Statist. 11 (1940) 301-310.
183. K. Spyropoulos, E. Kiountouzis, A. Young, Discrete approximation in the L1 norm, Comput. J. 16 (1973) 180-186.
184. E.L. Stiefel, Uber diskrete und lineare Tschebyscheff- Approximationen, Numer. Math. 1 (1959) 1-28.
185. E.L. Stiefel, Note on Jordan elimination, linear programming and Tchebyscheff approximation, Numer. Math. 2 (1960) 1-17.
186. J. Stoer, A direct method for Chebyshev approximation by rational functions, J. Assoc. Comput. Mach. 1 (1964) 59-69.
187. L. Tornheim, On n-parameter families of functions and associated convex functions, Trans. Amer. Math. Soc. 69 (1950) 457-467.
188. K.N. Usow, On L1 approximation I: computation for continuous functions and continuous dependence, SIAM J. Numer. Anal. 4 (1967) 70-88.
189. K.N. Usow, On L1 approximation II: computation for discrete functions and discretization effects, SIAM J. Numer. Anal. 4 (1967) 233-244.
190. C.J. de la Vallée Poussin, Sur la methode de l'approximation minimum, Societe Scientifique de Bruxelles, Annales, Memoires, Vol. 35, 1911, pp. 1-16.
191. L. Veidinger, On the numerical determination of the best approximations in the Chebyshev sense, Num. Math. 2 (1960) 99-105.
192. H.M. Wagner, Linear programming techniques for regression analysis, J. Amer. Statist. Assoc. 54 (1959) 206-212.
193. J.L. Walsh, The existence of rational functions of best approximation, Trans. Amer. Math. Soc. 33 (1931) 668-689.
194. G.A. Watson, A multiple exchange algorithm for multivariate Chebyshev approximation, SIAM J. Numer. Anal. 12 (1975) 46-52.
195. G.A. Watson, A method for calculating best nonlinear Chebyshev approximations, JIMA 18 (1976) 351-360.
196. G.A. Watson, On two methods for discrete Lp approximation, Computing 18 (1977) 263-266.
197. G.A. Watson, On a class of methods for nonlinear approximation problems, in: D.C. Handscomb (Ed.), Multivariate Approximation, Academic Press, London, 1978, pp. 219-227.
198. G.A. Watson, The minimax solution of an overdetermined system of nonlinear equations, JIMA 23 (1979) 167-180.
199. G.A. Watson, Approximation Theory and Numerical Methods, Wiley, Chichester, 1980.
200. G.A. Watson, An algorithm for linear L1 approximation of continuous functions, IMA J. Numer. Anal. 1 (1981) 157-167.
201. F. Wenzl, Uber Gleichungssysteme der Tschebysheffschen Approximation, Z. Angew. Math. Mech. 34 (1954) 385-391.
202. H. Werner, Die konstruktive Errmittlung der Tschebyscheff-Approximation in Bereich der rationalen Funktionen, Arch. Rational Mech. Anal. 11 (1962) 368-384.
203. H. Werner, Rationale-Tschebyscheff-Approximation, Eigenwerttheorie und Differenzenrechnung, Arch. Rational Mech. Anal. 13 (1963) 330-347.
204. H. Werner, Der Existenzsatz fur das Tschebyscheffsdhe Approximationsproblem mit Exponenttialsummen, in: L. Collatz, H. Unger (Eds.), Funktionalanalytische Methoden der numerischen Mathematik, ISNM, Vol. 12, Birkhauser, Basel, 1969, pp. 133-143.
205. H. Werner, Tschebysheff-Approximation with sums of exponentials, in: A. Talbot (Ed.), Approximation Theory, Academic Press, London, 1969, pp. 109-134.
206. J.M. Wolfe, On the convergence of an algorithm for discrete Lp approximation, Numer. Math. 32 (1979) 439-459.
207. R.S. Womersley, R. Fletcher, An algorithm for composite nonsmooth optimization problems, J. Optim. Theory Appl. 48 (1986) 493-523.
208. J.W. Young, General theory of approximation by functions involving a given number of arbitrary parameters, Trans. Amer. Math. Soc. 8 (1907) 331-344.
209. Y. Zhang, A primal-dual interior point approach for computing the l1 and lα solutions of overdetermined linear systems, J. Optim. Theory and Appl. 77 (1993) 323-341.
210. J.J. Zhou, A.L. Tits, An SQP algorithm for finitely discretized continuous minimax optimization problems and other minimax problems with many objective functions, SIAM J. Optim. 6 (1996) 461-487.
211. S.I. Zuhovickii, L.I. Avdeyeva, Linear and Convex Programming, (Translated from the 1964 Russian edition), Saunders Co., Philadelphia, 1966.
212. S.I. Zuhovickii, R.A. Poljak, M.E. Primak, An algorithm for the solution of the problem of Cebysev approximation, Soviet. Math. Dokl. 4 (1963) 901-904.