SIGN IN
SIGN UP
A remark on Bartels and Conn's linearly constrained, discrete
l
1
problems
Full Text:
PDF
Buy this Article
Authors:
Roger W. Koenker
Univ. of Illinois at Urbana-Champaign
Pin T. Ng
Univ. of Houston, Houston, TX
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 22 Issue 4, Dec. 1996
Pages 493-495
ACM
New York, NY
, USA
table of contents
doi>
10.1145/235815.235823
1996 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 8
· Downloads (cumulative): 222
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
l
1
norm
algorithms
constrained optimization
degeneracy
discrete approximation
gradient methods
linear programming
linearly constrained approximation
performance
reliability
statistical computing
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder