Fast and robust algorithm to compute exact polytope parameter bounds
暂无分享,去创建一个
[1] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..
[2] T. H. Matheiss,et al. A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..
[3] Balder Von Hohenbalken,et al. Least distance methods for the scheme of polytopes , 1978, Math. Program..
[4] J. Telgen. Redundancy and linear programs , 1981 .
[5] D. Gale. On The Number of Faces of a Convex Polytope , 1964, Canadian Journal of Mathematics.
[6] Y. F. Huang,et al. On the value of information in system identification - Bounded noise case , 1982, Autom..
[7] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .
[8] J. P. Norton,et al. Identification and application of bounded-parameter models , 1985, Autom..
[9] V. Broman,et al. A compact algorithm for the intersection and approximation of N -dimensional polytopes , 1990 .
[10] Hélène Piet-Lahanier,et al. Estimation de paramètres pour des modèles à erreur bornée , 1987 .
[11] M. Milanese,et al. Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimators , 1982 .
[12] E. Walter,et al. Exact and recursive description of the feasible parameter set for bounded error models , 1987, 26th IEEE Conference on Decision and Control.
[13] J. P. Norton,et al. Parameter-bounding identification algorithms for bounded-noise records , 1988 .
[14] Eric Walter,et al. Exact recursive characterization of feasible parameter sets in the linear case , 1990 .
[15] E. Walter,et al. Estimation of parameter bounds from bounded-error data: a survey , 1990 .
[16] J. Telgen. Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints , 1983 .