Algorithm 552: Solution of the Constrained I 1 Linear Approximation Problem [F4]

DOI10.1145/355887.355896MaRDI QIDQ3884548zbMATH OpenOpenAlexFDO

Authors F. D. K. Roberts, Ian Barrodale

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355887.355896

zbMATH Keywords

constrained l1 approximationlinear programmingsimplex method

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to approximations and expansions (41-04) Approximation by arbitrary linear expressions (41A45)

Cited in

(8)

• Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: Stability and moving-horizon approximations
• Spline smoothing under constraints on derivatives
• An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
• Algorithm 615: the best subset of parameters in leasst absolute value regression
• A singularity method for calculating hydrodynamic forces and particle velocities in low-Reynolds-number flows
• Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data
• A robust computational framework for variational data assimilation of mean flows with sparse measurements corrupted by strong outliers
• Learning weights in the generalized OWA operators

This page was built for publication: Algorithm 552: Solution of the Constrained I ₁ Linear Approximation Problem [F4]

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