Recursive algorithms for inner ellipsoidal approximation of convex polytopes

Automatica

Volumn 39, Issue 10, 2003, Pages 1773-1781

  Dabbene, Fabrizio ^a   Gay, Paolo ^b   Polyak, Boris T ^c  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

^c TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

Convex polytope; Ellipsoidal approximation; Estimation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; NONLINEAR EQUATIONS; OPTIMIZATION;

CONVEX OPTIMIZATIONS;

RECURSIVE FUNCTIONS;

EID: 0042013001     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(03)00180-8     Document Type: Article

References (18)

1. Bai E.-W., Cho H., Tempo R. Convergence properties of the membership set and noise model selection. Automatica. 34:1998;1245-1249.
2. Belforte G., Bona B., Cerone V. Parameter estimation algorithms for a set-membership description of uncertainty. Automatica. 26:1990;887-898.
3. Bondarko V., Yakubovich V.A. The method of recursive aim inequalities in adaptive control theory. International Journal on Adaptive Control and Signal Processing. 6:1992;141-160.
4. Boyd S.P., El Ghaoui L., Feron E., Balakrishnan V. Linear matrix inequalities in systems and control theory. 1994;SIAM, Philadelphia.
5. Calafiore G., Polyak B.T. Stochastic algorithms for exact and approximate feasibility of robust lmis. IEEE Transactions on Automatic Control. 46:2001;1755-1759.
6. Durieu C., Walter E., Polyak B.T. Multi-input multi-output ellipsoidal state bounding. Journal of Optimization Theory and Application. 111:2001;273-303.
7. Fogel E., Huang Y.F. On the value of information in system identification - bounded noise case. Automatica. 18:1982;229-238.
8. Kendall M., Stewart A. The advanced theory of statistics. 1977;Griffin, London.
9. Khachiyan L.G., Todd M.J. On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Mathematical Programming. 61:1990;137-159.
10. Mo, S. H., & Norton, J. P. (1990). Fast and robust algorithm to compute exact polytope parameter bounds. Maths. & Computers in Simulation 32, 481-493.
11. Nesterov Yu., Nemirovskii A. Interior-point polynomial algorithms in convex programming. 1994;SIAM, Philadelphia.
12. Polyak B.T. A general method for solving extremum problems. Soviet Mathematics Doklady. 3:1967;593-597.
13. Polyak B.T., Tempo R. Probabilistic robust design with linear quadratic regulators. System and Control Letters. 43:2001;343-353.
14. Pronzato, L., & Walter, E. (1996). Volume-optimal inner and outer ellipsoids. In M. Milanese et al. (Eds.), Bounding approaches to system identification, New York: Plenum Press, pp 119-138.
15. Saigal, R., Vanderberghe, L., & Wolkowicz, H. (Eds.). (2000). Handbook of semidefinite programming. Waterloo: Kluwer Academic Publishers.
16. Tarasov S., Khachiyan L.G., Erlikh I. The method of inscribed ellipsoids. Soviet Mathematics Doklady. 37:1988;226-230.
17. Vandenberghe L., Boyd S. Applications of semidefinite programming. Applied Numerical Mathematics. 29:1999;283-299.
18. Wojciechowski J.M., Vlach J. Ellipsoidal method for design centering and yield estimation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12:1993;1570-1579.