ALGORITHM FOR A RESTRICTED DISCRETE APPROXIMATION PROBLEM IN L1 NORM

被引:27
作者
ARMSTRONG, RD [1 ]
HULTZ, JW [1 ]
机构
[1] UNIV TEXAS,CTR CYBERNET STUDIES,AUSTIN,TX 78712
关键词
D O I
10.1137/0714034
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:555 / 565
页数:11
相关论文
共 14 条
[1]   ALGORITHMS FOR BEST L1 AND LINFINITY LINEAR APPROXIMATIONS ON A DISCRETE SET [J].
BARRODALE, I ;
YOUNG, A .
NUMERISCHE MATHEMATIK, 1966, 8 (03) :295-+
[2]   IMPROVED ALGORITHM FOR DISCRETE L1 LINEAR-APPROXIMATION [J].
BARRODALE, I ;
ROBERTS, FDK .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (05) :839-848
[3]   AN EXPLICIT SOLUTION OF A SPECIAL CLASS OF LINEAR PROGRAMMING PROBLEMS [J].
BENISRAEL, A ;
CHARNES, A .
OPERATIONS RESEARCH, 1968, 16 (06) :1166-+
[4]   OPTIMALITY AND DEGENERACY IN LINEAR PROGRAMMING [J].
Charnes, A. .
ECONOMETRICA, 1952, 20 (02) :160-170
[5]  
CHARNES A, 1955, MANAGE SCI, V2, P138
[6]  
CHARNES A, 1961, MANAGEMENT MODELS IN, V1
[7]  
CHARNES A, 1971, CS55 U TEX CTR CYB S
[8]  
GOTTFIED BS, 1973, INTRO OPTIMIZATION T
[9]   APPLICATIONS OF LINEAR PROGRAMMING TO NUMERICAL ANALYSIS [J].
RABINOWI.P .
SIAM REVIEW, 1968, 10 (02) :121-&
[10]  
Roberts P. D., 1970, Linear Algebra and Its Applications, V3, P383, DOI 10.1016/0024-3795(70)90008-X