Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the associated linear operator maps the cone of positive semidefinite matrices onto itself. In this case,...
Internet
https://thesis.library.caltech.edu/1647/1/Parrilo-Thesis.pdfParrilo, Pablo A. (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/2K6Y-CH43. https://resolver.caltech.edu/CaltechETD:etd-05062004-055516 <https://resolver.caltech.edu/CaltechETD:etd-05062004-055516>