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

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

This publication has 3 references indexed in Scilit: