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

Authors:
Roger W. Koenker;Pin T. Ng
Affiliations:
Univ. of Illinois at Urbana-Champaign;Univ. of Houston, Houston, TX
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1996

Citing 2
Cited 0

An algorithm for quantile smoothing splines

Computational Statistics & Data Analysis
Linearly Constrained Discrete I1 Problems

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Two modifications of Bartels and Conn's algorithm for solving linearly constrained discrete l1 problems are described. The modifications are designed to improve performance of the algorithm under conditions of degeneracy.