A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On solving semidefinite programming by quantifier elimination
1998
Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207)
In this paper we report one successful application of Quantifier Elimination $(\mathrm{Q}\mathrm{E})$ method to control problems; We focus on the Semidefinite Programming $(SDP)$ problems, which are the central among the generic Linear Matrix Inequality $(LMI)$ problems. Since many control problems and design specifications are reduced to LMI formulations, the LMI problems are that of great practical and theoretical interest in control theory. Though the SDP problems are usually solved as
doi:10.1109/acc.1998.688368
fatcat:e2gll7p4e5hpznawxj6wlhn5ii