A revised simplex algorithm for the absolute deviation curve fitting problem

DOI10.1080/03610917908812113zbMath0439.65049OpenAlexW1965223097MaRDI QIDQ3881823

Edward L. Frome, David S. Kung, Ronald D. Armstrong

Publication date: 1979

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610917908812113

zbMATH Keywords

curve fittingsimplex methodLU decompositionFORTRAN programl1 approximation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Linear regression; mixed models (62J05) Numerical mathematical programming methods (65K05) Linear programming (90C05) Best approximation, Chebyshev systems (41A50)

Related Items (25)

Algorithm: Clusterwise linear least absolute deviations regression ⋮ Exchange Rate Sensitivity of Firm Value: Evidence from Nonfinancial Firms Listed on Borsa Istanbul ⋮ A fast algorithm for clusterwise linear absolute deviations regression ⋮ Inference procedures for the \(L_ 1\) regression ⋮ Bootstrapping in least absolute value regression: an application to hypothesis testing ⋮ Least Absolute Regression Revisited ⋮ -Chart with runs and variable sampling intervals ⋮ Multiple criteria linear regression ⋮ Least absolute deviations estimation for uncertain regression with imprecise observations ⋮ An algorithm for a least absolute value regression problem with bounds on the parameters ⋮ Solve least absolute value regression problems using modified goal programming techniques. ⋮ A piecewise linear approximation procedure forL_pnorm curve fitting ⋮ Minimization technique for a convex function with application to multiple regression model ⋮ Least absolute value and chebychev estimation utilizing least squares results ⋮ Lagrangian approach for large-scale least absolute value estimation ⋮ Least absolute value regression: recent contributions ⋮ Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression ⋮ Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem. ⋮ Linear programming and \(\ell _ 1\) regression: A geometric interpretation ⋮ A new descent algorithm for the least absolute value regression problem ⋮ Piecewise linear programming via interior points ⋮ Up- and down-dating procedures for linear \(L_ 1\) regression ⋮ On the use of the simplex algorithm for the absolute deviation curve fitting problem ⋮ Algorithms for unconstrained \(L_ 1\) simple linear regression ⋮ An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.

This page was built for publication: A revised simplex algorithm for the absolute deviation curve fitting problem