Chebyshev approximation of a point set by a straight line

Abstract

The problem of calculating the best approximating straight line—in the sense of Chebyshev—to a finite set of points inRn is considered. First-and second-order optimality conditions are derived and analysed. Lipschitz optimization techniques can be used to find a global minimizer