A remark on Bartels and Conn's linearly constrained, discrete l 1 problems

DOI10.1145/235815.235823zbMath0887.65060OpenAlexW2081657455MaRDI QIDQ4371116

Roger W. Koenker, Pin T. Ng

Publication date: 7 January 1998

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

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1996-22/

zbMATH Keywords

algorithmdegeneracydiscrete approximationlinearly constrained approximation

Mathematics Subject Classification ID

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

Related Items (2)

COBS: qualitatively constrained smoothing via linear programming ⋮ A fast and efficient implementation of qualitatively constrained quantile smoothing splines

This page was built for publication: A remark on Bartels and Conn's linearly constrained, discrete l ₁ problems