An Algorithm for a Restricted Discrete Approximation Problem in the $L_1 $ Norm

DOI10.1137/0714034zbMath0367.65032OpenAlexW2009422251MaRDI QIDQ4144118

John Hultz, Ronald D. Armstrong

Publication date: 1977

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0714034

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (8)

Chebyshev and L₁solutions of overdetermined systems of linear equations with bounded variables ⋮ An algorithm for quantile smoothing splines ⋮ An algorithm for a least absolute value regression problem with bounds on the parameters ⋮ Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression ⋮ Linear programming and \(\ell _ 1\) regression: A geometric interpretation ⋮ Goal programming models and their duality relations for use in evaluating security portfolio and regression relations ⋮ Estimation of a distribution function by extrapolating upper and lower bounds ⋮ An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.

This page was built for publication: An Algorithm for a Restricted Discrete Approximation Problem in the $L_1 $ Norm