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

被引：2

作者：

Koenker, RW

Ng, PT

机构：

[1] UNIV HOUSTON,DEPT ECON,HOUSTON,TX 77204

[2] UNIV ILLINOIS,DEPT ECON,CHAMPAIGN,IL 61820

来源：

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1996年 / 22卷 / 04期

关键词：

degeneracy; discrete approximation; l(1) norm; linearly constrained approximation;

D O I：

10.1145/235815.235823

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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

引用

页码：493 / 495

页数：3