A Remark on Bartels and Conn's Linearly Constrained, Discrete l1 Problems

ACM Transactions on Mathematical Software

Volumn 22, Issue 4, 1996, Pages 493-495

  Koenker, Roger W ^a   Ng, Pin ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF HOUSTON   (United States)

Author 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

Indexed keywords

CONSTRAINT THEORY; LINEAR PROGRAMMING; NUMERICAL ANALYSIS; RELIABILITY THEORY;

BARTELS AND CONN'S ALGORITHM; DEGENERACY; DISCRETE APPROXIMATION; LINEARLY CONSTRAINED APPROXIMATION;

ALGORITHMS;

EID: 0030420005     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/235815.235823     Document Type: Article

References (4)

1. 1 problems. ACM Trans. Math. Softw. 6, 4, 594-608.
2. GILL, P. E., MURRAY, W., AND WRIGHT, M. H. 1991. Numerical Linear Algebra and Optimization. Addison-Wesley, Reading, Mass.
3. KOENKER, R., NG, P., AND PORTNOY, S. L. 1994. Quantile smoothing splines. Biometrika 84, 4, 673-680.
4. NG, P. 1996. An algorithm for quantile smoothing splines. Comput. Stat. Data Anal. 22, 99-118.