Exact Recursive Polyhedral Description of the Feasible Parameter Set for Bounded-Error Models

IEEE Transactions on Automatic Control

Volumn 34, Issue 8, 1989, Pages 911-915

  Walter, E ^a   Piet Lahanier, H ^a  

^a SUPELEC   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--VECTORS;

BOUNDED-ERROR MODELS; POLYHEDRAL CONE;

CONTROL SYSTEMS, LINEAR;

EID: 0024714671     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.29443     Document Type: Article

References (14)

1. E. Fogel Y.F. Huang, On the value of information in system identification, bounded noise case, Automatica, vol 18, pp. 229–238.
2. E. Fogel, “Membership set estimation—An alternative approach to system identification,” in Preprints 6th IFAC Symp. Identification Syst. Parameter Est.,Washington, DC, June 1982, pp. 614–616.
3. M. Milanese and G. Belforte, “Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors, linear families of models and estimators,” IEEE Trans. Automat. Contr., vol. AC-27, pp. 408–414, Apr. 1982.
4. G. Belforte and B. Bona, “An improved parameter identification algorithm for signals with unknown-but-bounded errors,” in Proc. 7th IFAC/IFORS Symp. Identification Syst. Parameter Est., York, England, July 1985, pp. 1507–1512.
5. S. Dasgupta and Y.F. Huang, “Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 383–392, May 1987.
6. S. H. Mo and J. P. Norton, “Parameter-bounding identification algorithms for bounded-noise records,” Proc. IEE, vol. 135, part D, pp. 127–132, Mar. 1988.
7. G. Belforte and M. Milanese, “Uncertainty interval evaluation in presence of unknown-but-bounded errors—Nonlinear families of models,” in Proc. lst IASTED Int. Symp. Modeling, Ident. Contr., Davos, Switzerland, Feb. 1981, pp. 75–79.
8. E. Walter and H. Piet-Lahanier, “Robust nonlinear parameter estimation in the bounded noise case,” in Proc. 25th IEEE Conf. Decision Contr., Athens, Greece, Dec. 1986, 1037–1042.
9. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, “The double description method,” in Contributions to the Theory of Games, H. W. Kuhn and A. W. Tucker, Ed., Annals of Mathematics Studies, Princeton, NJ: Princeton Univ. Press, no. 28, 1953, 51–73.
10. H. Greenberg, “An algorithm for determining redundant inequalities and all solutions to convex polyhedra,” Numer. Math., vol. 24, pp. 19–26, 1975.
11. N. V. Chernikova, “Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities,” U.S.S.R. Computational Math. Math. Phys., vol. 5, pp. 228–233, 1965.
12. H. Piet-Lahanier and E. Walter, “Practical implementation of an exact and recursive algorithm for characterizing likelihood sets,” in Proc. 12th IMACS World Congr., Paris, France, July 1988, vol. 2, pp. 481–483.
13. B. F. Sherman, “A counter example to Greenberg’s algorithm for solving linear inequalities,” Numer. Math., vol. 27, pp. 491–492, 1977.
14. V. Broman and M. J. Shensa, “Polytopes, A novel approach to tracking,” in Proc. 25th IEEE Conf. Decision Contr., Athens, Greece, Dec. 1986, pp. 1749-1752.