A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs

Automatica

Volumn 43, Issue 12, 2007, Pages 2022-2033

  Calafiore, Giuseppe C ^a   Dabbene, Fabrizio ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Randomized algorithms; Robust control; Uncertain linear matrix inequalities

Indexed keywords

ALGORITHMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES; ROBUST CONTROL; UNCERTAIN SYSTEMS;

RANDOMIZED ALGORITHMS; UNCERTAIN LINEAR MATRIX INEQUALITIES;

LINEAR MATRIX INEQUALITIES;

EID: 36248929488     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2007.04.003     Document Type: Article

References (31)

1. Alamo, T., Tempo, R., Ramirez, D. R., & Camacho, E. F. (2007). A new vertex result for robustness problems with interval matrix uncertainty. In Proceedings of the European control conference.
2. Atkinson D.S., and Vaidya P.M. A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming, Series B 69 (1995) 1-43
3. Barmish B.R. New tools for robustness of linear systems (1994), MacMillan, New York
4. Ben-Tal A., and Nemirovski A. Robust convex optimization. Mathematics of Operations Research 23 (1998) 769-805
5. Ben-Tal A., and Nemirovski A. On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM Journal on Optimization 12 3 (2002) 811-833
6. Bliman P.-A. A convex approach to robust stability for linear systems with uncertain scalar parameters. SIAM Journal on Control and Optimization 42 6 (2004) 2016-2042
7. Boyd S., and El Ghaoui L. Method of centers for minimizing generalized eigenvalues. Linear Algebra and its Applications (Special Issue on Systems and Control) 188 (1993) 63-111
8. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge.
9. Calafiore, G. (2006). Cutting plane methods for probabilistically-robust feasibility problems. In Proceedings of mathematical theory of networks and systems, Kyoto, Japan.
10. Calafiore G., and Campi M.C. Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming 102 1 (2005) 25-46
11. Calafiore G., and Campi M.C. The scenario approach to robust control design. IEEE Transactions on Automatic Control 51 5 (2006) 742-753
12. Calafiore, G., & Dabbene, F. (Eds.) (2006). Probabilistic and randomized methods for design under uncertainty. London: Springer.
13. Calafiore G., and Polyak B.T. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control 46 (2001) 1755-1759
14. El Ghaoui L., Oustry F., and Lebret H. Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization 9 (1998) 33-52
15. Goffin J.-L., Luo Z.Q., and Ye Y. Complexity analysis of an interior point cutting plane method for convex feasibility problems. SIAM Journal on Optimization 6 (1996) 638-652
16. Goffin J.-L., and Vial J.-P. Shallow, deep and very deep cuts in the analytic center cutting plane method. Mathematical Programming 84 (1999) 89-103
17. Goffin J.-L., and Vial J.-P. Convex non-differentiable optimization: A survey focused on the analytic center cutting plane method. Optimization Methods & Software 17 (2002) 805-867
18. Kanev S., De Schutter B., and Verhaegen M. An ellipsoid algorithm for probabilistic robust controller design. Systems & Control Letters 49 (2003) 365-375
19. Kanev S., and Verhaegen M. The randomized ellipsoid algorithm for constrained robust least squares problems. Probabilistic and randomized methods for design under uncertainty (2006), Springer, London 223-242
20. Khachiyan L.G. A polynomial time algorithm for linear programming. Soviet Math. Doklady 20 (1979) 191-194
21. Lovász L., Grötschel M., and Schrijver A. Geometric algorithms and combinatorial optimization (1993), Springer, New York
22. Mitchell J.E. Polynomial interior point cutting plane methods. Optimization Methods & Software 18 (2003) 507-534
23. Nemirovski A.S., and Yudin D.B. Problem complexity and method efficiency in optimization (1983), Wiley, New York
24. Oishi, Y. (2003). Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions. In Proceedings of the IEEE conference on decision and control.
25. Oishi Y. Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities. Automatica 43 (2007) 538-545
26. Oishi Y., and Kimura H. Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. Automatica 39 (2003) 2149-2156
27. Péton, O. (2002). The homogeneous analytic center cutting plane method. Ph.D. Thesis, Université de Genève.
28. Polyak B.T., and Tempo R. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters 43 (2001) 343-353
29. Scherer C.W. Relaxations for robust linear matrix inequality problems with verifications for exactness. SIAM Journal on Matrix Analysis and Applications 27 2 (2005) 365-395
30. Shor N.Z. Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics 13 (1970) 94-96
31. Tempo, R., Calafiore, G., & Dabbene, F. (2004). Randomized algorithms for analysis and control of uncertain systems. Communications and control engineering series. London: Springer.