Comparison of methods for solving sets of linear inequalities in the bounded-error context
- 1 December 1992
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 34 (6) , 515-524
- https://doi.org/10.1016/0378-4754(92)90038-i
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fast and robust algorithm to compute exact polytope parameter boundsMathematics and Computers in Simulation, 1990
- A compact algorithm for the intersection and approximation of N-dimensional polytopesMathematics and Computers in Simulation, 1990
- Parameter estimation algorithms for a set-membership description of uncertaintyAutomatica, 1990
- Set membership identification in digital signal processingIEEE ASSP Magazine, 1989
- Structure identification of parameter-bounding models by use of noise-structure boundsInternational Journal of Control, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- 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
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- Recursive state estimation: Unknown but bounded errors and system inputsIEEE Transactions on Automatic Control, 1968