An interative linear programming solution to the Euclidean regression model

A mathematical programming approach is employed to solve the n-dimensional linear Euclidean regression problem, in which the objective is to determine a hyperplane which minimizes the sum of the normal Euclidean distances to a given set of data points. Although the problem is a nonlinear nonconvex programming problem, an efficient solution algorithm is developed which solves a succession of linear programming problems.