On solving semidefinite programming by quantifier elimination

Several interesting control system design and analysis problems can be reduced to quantifier elimination (QE) problems. In this paper, we focus on semidefinite programming (SDP) problems, which are one of the generic linear matrix inequality (LMI) problems. We present a new symbolic method based on QE for the SDP problems and show some experiment by using existing QE package to demonstrate the capability of the method. Though currently this method is practically applicable to modest size problems which existing QE software can solve, it gives one exact solutions and enables one to deal with nonconvex as well as parametric cases. Moreover, in our scheme, the model or parameter uncertainties are easy to incorporate in the SDP problems.

[1]  A. Seidenberg.  A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[2]  Volker Weispfenning,et al.  Simulation and Optimization by Quantifier Elimination , 1997, J. Symb. Comput..

[3]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[4]  Hoon Hong,et al.  Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination , 1992, ISSAC '92.

[5]  M. Jirstrand.  Algebraic Methods for Modeling and Design in Control , 1996 .

[6]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[7]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[8]  Masayuki Noro,et al.  Risa/Asir—a computer algebra system , 1992, ISSAC '92.

[9]  B. Anderson,et al.  Output feedback stabilization and related problems-solution via decision methods , 1975 .

[10]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[11]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[12]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[13]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.