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.
Original language | English (US) |
---|---|
Pages (from-to) | 493-495 |
Number of pages | 3 |
Journal | ACM Transactions on Mathematical Software |
Volume | 22 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1996 |
Keywords
- Algorithms
- Degeneracy
- G.1.6 [Numerical Analysis]: Optimization - constrained optimization; gradient methods; linear programming
- G.3 [Mathematics of Computing]: Probability and Statistics - statistical computing
- Performance
- Reliability
- Theory
ASJC Scopus subject areas
- Software
- Applied Mathematics