Skip to Main content Skip to Navigation
Reports

On Positiveness of Matrix-Valued Polynomials and Robust Semidefinite Programming

Abstract : This report is devoted to the study of robust semidefinite programming. We show that to the issue of computing the worst-case optimal value of semidefinite programs depending polynomially upon a finite number of bounded scalar parameters, one may associate a countable family of standard semidefinite programs, whose optimal values converge monotonically towards the requested quantity. The results is linked to representation formula and positiveness criterion for matrix-valued polynomials.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071674
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:29:57 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:32:41 PM

Identifiers

  • HAL Id : inria-00071674, version 1

Collections

Citation

Pierre-Alexandre Bliman. On Positiveness of Matrix-Valued Polynomials and Robust Semidefinite Programming. [Research Report] RR-4906, INRIA. 2003. ⟨inria-00071674⟩

Share

Metrics

Record views

186

Files downloads

119