An iterative linear programming solution to the Euclidean regression model

DOI10.1016/0305-0548(91)90003-AMaRDI QIDQ1184455zbMATH OpenFDO

Authors Tom M. Cavalier, Brian J. Melloy

Publication date 28 June 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

\(n\)-dimensional linear Euclidean regression problemnonlinear nonconvex programmingsuccession of linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Orthogonal linear regression algorithm based on augmented matrix formulation
• An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
• Publication:4863205
• Average linear least squares regression
• A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

Cites work

• scientific article; zbMATH DE number 3488458 (Why is no real title available?)
• Finding Least-Distances Lines

Cited in

(4)

• Locating hyperplanes to fitting set of points: a general framework
• Fixed point iteration in identifying bilinear models
• Robust computation of linear models by convex relaxation
• Orthogonal linear regression algorithm based on augmented matrix formulation

This page was built for publication: An iterative linear programming solution to the Euclidean regression model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184455)