Fast and robust algorithm to compute exact polytope parameter bounds
- 31 December 1990
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 32 (5-6) , 481-493
- https://doi.org/10.1016/0378-4754(90)90004-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A compact algorithm for the intersection and approximation of N-dimensional polytopesMathematics and Computers in Simulation, 1990
- Exact recursive characterization of feasible parameter sets in the linear caseMathematics and Computers in Simulation, 1990
- Estimation of parameter bounds from bounded-error data: a surveyMathematics and Computers in Simulation, 1990
- Parameter-bounding identification algorithms for bounded-noise recordsIEE Proceedings D Control Theory and Applications, 1988
- Exact and recursive description of the feasible parameter set for bounded error modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Identification and application of bounded-parameter modelsAutomatica, 1987
- Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimatorsIEEE Transactions on Automatic Control, 1982
- On the value of information in system identification—Bounded noise caseAutomatica, 1982
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- On The Number of Faces of a Convex PolytopeCanadian Journal of Mathematics, 1964