Distributional robustness analysis for polynomial uncertainty

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This paper addresses the problem of computing the worst-case expected value of a polynomial function, over a class of admissible distributions. It is shown that this problem, for the class of distributions considered, is equivalent to a convex optimization problem for which efficient linear matrix inequality (LMI) relaxations are available. In case that the performance function is continuous (not necessarily polynomial), the worst-case expected value can be approximated by using its polynomial approximations. Moreover, the proposed approach is applied to compute hard bounds of the worst-case probability of a polynomial being negative. Numerical examples are presented which illustrate the application of the results in this paper.

Original languageEnglish (US)
Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1151-1156
Number of pages6
ISBN (Print)9781424438716
DOIs
StatePublished - 2009
Event48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009 - Shanghai, China
Duration: Dec 15 2009Dec 18 2009

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
Country/TerritoryChina
CityShanghai
Period12/15/0912/18/09

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Distributional robustness analysis for polynomial uncertainty'. Together they form a unique fingerprint.

Cite this