FAST AND ROBUST ALGORITHM TO COMPUTE EXACT POLYTOPE PARAMETER BOUNDS

被引:69
作者
MO, SH
NORTON, JP
机构
[1] JAGUAR CARS LTD,COVENTRY CV3 4LF,ENGLAND
[2] UNIV BIRMINGHAM,SCH ELECTR & ELECT ENGN,BIRMINGHAM B15 2TT,W MIDLANDS,ENGLAND
关键词
D O I
10.1016/0378-4754(90)90004-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
When bounds on the parameters of a linear-in-the-parameters model are computed, the exact feasible parameter set defined by the bounds (a polytope) is usually approximated by a simpler shape such as an ellipsoid. However, such simpler bounds may be much looser than the exact bounds. A new algorithm for updating the exact bounds is presented and compared with other recently published methods. Computational results illustrate exact polytope-bound updating by this algorithm from records of realistic length.
引用
收藏
页码:481 / 493
页数:13
相关论文
共 22 条
[1]   AN ALGORITHM FOR FINDING ALL VERTICES OF CONVEX POLYHEDRAL SETS [J].
BALINSKI, ML .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (01) :72-88
[2]   A COMPACT ALGORITHM FOR THE INTERSECTION AND APPROXIMATION OF N-DIMENSIONAL POLYTOPES [J].
BROMAN, V ;
SHENSA, MJ .
MATHEMATICS AND COMPUTERS IN SIMULATION, 1990, 32 (5-6) :469-480
[3]   ON THE VALUE OF INFORMATION IN SYSTEM-IDENTIFICATION - BOUNDED NOISE CASE [J].
FOGEL, E ;
HUANG, YF .
AUTOMATICA, 1982, 18 (02) :229-238
[4]   ON NUMBER OF FACES OF CONVEX POLYTOPE [J].
GALE, D .
CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (01) :12-&
[5]  
Grunbaum B., 2003, CONVEX POLYTOPES, V2nd
[6]  
HOHENBALKEN BV, 1975, RES PAPER SERIES U A, V24
[7]  
HOHENBALKEN BV, 1975, RES PAPER SERIES, V25
[8]  
HOHENBALKEN BV, 1978, MATH PROGRAM, V15, P1
[9]   ALGORITHM FOR DETERMINING IRRELEVANT CONSTRAINTS AND ALL VERTICES IN SYSTEMS OF LINEAR INEQUALITIES [J].
MATTHEISS, TH .
OPERATIONS RESEARCH, 1973, 21 (01) :247-260
[10]   A SURVEY AND COMPARISON OF METHODS FOR FINDING ALL VERTICES OF CONVEX POLYHEDRAL-SETS [J].
MATHEISS, TH ;
RUBIN, DS .
MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (02) :167-185