LMI approximations for the radius of the intersection of ellipsoids: Survey

Journal of Optimization Theory and Applications

Volumn 108, Issue 1, 2001, Pages 1-28

  Henrion, D ^a   Tarbouriech, S ^a   Arzelier, D ^a  

^a CNRS   (France)

Author keywords

Convex relaxations; Ellipsoids; Linear matrix inequalities; Nonconvex optimization; Robust control

Indexed keywords

APPROXIMATION ALGORITHMS; LINEAR MATRIX INEQUALITIES; QUALITY CONTROL; RELAXATION PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); SURVEYS;

CONVEX RELAXATION; ELLIPSOID; LINEAR MATRIX IN EQUALITIES; MAXIMUM NORM; NONCONVEX OPTIMIZATION; NONCONVEX OPTIMIZATION PROBLEM; NONCONVEX-OPTIMIZATION; PAPER SURVEYS; RELAXATION TECHNIQUES; ROBUST CONTROL SYNTHESIS;

ROBUST CONTROL;

EID: 0035529813     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026454804250     Document Type: Article

References (29)

1. 1. SAFONOV, M. G., and PAPAVASSILOPOULOS, G. P., The Diameter of an Intersection of Ellipsoids and BMI Robust Synthesis, Proceedings of the IFAC Symposium on Robust Control Design, Rio de Janeiro, Brazil, pp. 313-317, 1994.
2. 2. GOH, K. C., SAFONOV, M. G., and LY, J. H., Robust Synthesis via Bilinear Matrix Inequalities, International Journal of Robust and Nonlinear Control, Vol. 6, pp. 1079-1095, 1996.
3. 3. HENRION, D., TARBOURIECH, S., and ŠEBEK, M., Algebraic Approach to Robust Controller Design: A Geometric Interpretation, Proceedings of the American Control Conference, Philadelphia, Pennsylvania, pp. 2703-2707, 1998.
4. 4. KUČERA, V., Diophantine Equations in Control: A Survey, Automatica, Vol. 29, pp. 1361-1375, 1993.
5. 5. FUHRMANN, P. A., and DATTA, B. N., Bezoutians, Vandermonde Matrices, and the Liénard-Chipart Stability Criterion, Linear Algebra and Its Applications, Vol. 120, pp. 23-37, 1989.
6. 6. HENRION, D., TARBOURIECH, S., and ŠEBEK, M., Rank-One LMI Approach to Simultaneous Stabilization of Linear Systems, Systems and Control Letters, Vol. 38, pp. 79-89, 1999.
7. 7. BLONDEL, V., and TSITSIKLIS, J., NP-Hardness of Some Linear Control Design Problems, SIAM Journal on Control and Optimization, Vol. 35, pp. 2118-2127, 1997.
8. 8. MAKSAROV, D. G., and NORTON, J. P., Bounding with Ellipsoidal Set Description of the Uncertainty, International Journal of Control, Vol. 65, pp. 847-866, 1996.
9. 9. DURIEU, C., POLYAK, B. T., and WALTER, E., Trace Versus Determinant in Ellipsoidal Outer-Bounding, with Application to State Estimation, Proceedings of the IFAC World Congress, San Francisco, California, pp. 43-48, 1996.
10. 10. BEN-TAL, A., and NEMIROVSKI, A., Robust Convex Optimization, Mathematics of Operations Research, Vol. 23, pp. 769-805, 1998.
11. 11. BEN-TAL, A., EL GHAOUI, L., and NEMIROVSKI, A., Robustness, Handbook of Semidefinite Programming, Edited by H. Wolkowicz, R. Saigal, and L. Vandenberghe, Kluwer Academic Publishers, Waterloo, Canada, pp. 139-162, 2000.
12. 12. HORST, R., and TUY, H., Global Optimization: Deterministic Approaches, 3rd Revised and Enlarged Edition, Springer Verlag, Berlin, Germany, 1996.
13. 13. NESTEROV, Y., and NEMIROVSKI, A., Interior-Point Polynomial Methods in Convex Programming, SIAM, Philadelphia, Pennsylvania, 1994.
14. 14. FU, M., LUO, Z. Q., and YE, Y., Approximation Algorithms for Quadratic Programming, Journal of Combinatorial Optimization, Vol. 2, pp. 29-50, 1998.
15. 15. BOYD, S., EL GHAOUI, L., FERON, E., and BALAKRISHNAN, V., Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, Pennsylvania, 1994.
16. 16. BALAKRISHNAN, V., and BOYD, S., Global Optimization in Control System Analysis and Synthesis, Technical Report, Stanford University, Stanford, California, 1991.
17. 17. VANDENBERGHE, L., and BOYD, S., Semidefinite Programming, SIAM Review, Vol. 38, pp. 49-95, 1996.
18. 18. GAHINET, P., NEMIROVSKI, A., LAUB, A. J., and CHILALI, M., Matlab LMI Control Toolbox, The MathWorks, Natick, Massachusetts, 1995.
19. 19. WU, S. P., and BOYD, S., A Parser/Solver for Semidefinite Programming and Determinant Maximization Problems with Matrix Structure, Technical Report, Stanford University, Stanford, California, 1996.
20. 20. BOYD, S., and VANDENBERGHE, L., Semidefinite Programming Relaxations of Nonconvex Problems in Control and Combinatorial Optimization, Communications, Computation, Control, and Signal Processing: A Tribute to Thomas Kailath, Edited by A. Paulraj, V. Roychowdhury, and C. Schaper, Kluwer Academic Publishers, Dordrecht, Holland, 1997.
21. 21. GOEMANS, M. X., and WILLIAMSON, D. P., Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, Journal of the ACM, Vol. 42, pp. 1115-1145, 1995.
22. 22. NEMIROVSKI, A., ROOS, C., and TERLAKY, T., On Maximization of Quadratic Forms over Intersection of Ellipsoids with Common Center, Mathematical Programming, Vol. 86, pp. 463-473, 1999.
23. 23. NESTEROV, Y., Semidefinite Relaxation and Nonconvex Quadratic Optimization, Optimization Methods and Software, Vol. 9, pp. 141-160, 1998.
24. 24. YE, Y., Approximating Quadratic Programming with Bound and Quadratic Constraints, Mathematical Programming, Vol. 84, pp. 219-226, 1999.
25. 25. BOYD, S., and EL GHAOUI, L., Method of Centers for Minimizing Generalized Eigenvalues, Linear Algebra and Its Applications, Vol. 188, pp. 63-111, 1993.
26. 26. VANDENBERGHE, L., BOYD, S., and WU, S. P., Determinant Maximization with Linear Matrix Inequality Constraint, SIAM Journal on Matrix Analysis and Applications, Vol. 19, pp. 499-533, 1998.
27. 27. QUIST, A. J., DE KLERK, E., ROOS, C., and TERLAKY, T., Copositive Relaxation for General Quadratic Programming, Optimization Methods and Software, Vol. 9, pp. 185-209, 1998.
28. 28. FLIPPO, O. E., and JANSEN, B., Duality and Sensitivity in Quadratic Optimization over a Sphere, Technical Report 92-65, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, Holland, 1992.
29. 29. BEN-TAL, A., and TEBOULLE, M., Hidden Convexity in Some Nonconvex Quadratically Constrained Quadratic Programming, Mathematical Programming, Vol. 72, pp. 51-63, 1996.