Abstract
The problem of calculating the best approximating straight line—in the sense of Chebyshev—to a finite set of points inR n is considered. First-and second-order optimality conditions are derived and analysed. Lipschitz optimization techniques can be used to find a global minimizer.
Similar content being viewed by others
References
A. Ben-Tal (1980):Second-order and related extremality conditions in nonlinear programming. J. Optim. Theory Appl.,31:143–165.
D. J. Elzinga, D. W. Hearn (1972):The minimum covering sphere problem. Management Sci.,19(1):96–104.
P. Gritzmann, V. Klee (1992):Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput. Geom.,7:255–280.
R. Hettich, H. Th. Jongen (1976):On first-and second-order conditions for local optima for optimization problems in finite dimensions. Methods Oper. Res.,13:82–94.
R. Horst, H. Tuy (1987):On the convergence of global methods in multiextremal optimization. J. Optim. Theory Appl.,54(2):253–271.
R. Horst, H. Tuy (1990): Global Optimization. Berlin: Springer-Verlag.
M. J. D. Powell (1982):Extensions to subroutine VF02AD. In: System Modeling and Optimization (R. F. Drenick F. Kozin, eds.). Lecture Notes in Control and Information Sciences, vol. 38. Berlin: Springer-Verlag, pp. 529–538.
H. Späth (1986):Orthogonal least squares fitting with linear manifolds. Numer. Math.,48:441–445.
W. Wetterling (1988). Chebyshev Approximation by Parametrized Curves. Memorandum No. 756, University of Twente, Enschede.
W. Wetterling (1991):Application of Chebyshev approximation to curve fitting.Z. Angew. Math. Mech. 71(7–8):291–292.
Author information
Authors and Affiliations
Additional information
Communicated by Dietrich Braess.
Rights and permissions
About this article
Cite this article
Streng, M., Wetterling, W. Chebyshev approximation of a point set by a straight line. Constr. Approx 10, 187–196 (1994). https://doi.org/10.1007/BF01263063
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01263063