### Abstract

In this paper, "chance optimization" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective of developing systematic numerical procedures to solve such problems, a sequence of convex relaxations based on the theory of measures and moments is provided, whose sequence of optimal values is shown to converge to the optimal value of the original problem. Indeed, we provide a sequence of semidefinite programs of increasing dimension which can arbitrarily approximate the solution of the original problem. To be able to efficiently solve the resulting large-scale semidefinite relaxations, a first-order augmented Lagrangian algorithm is implemented. Numerical examples are presented to illustrate the computational performance of the proposed approach.

Original language | English (US) |
---|---|

Pages (from-to) | 1411-1440 |

Number of pages | 30 |

Journal | SIAM Journal on Optimization |

Volume | 25 |

Issue number | 3 |

DOIs | |

State | Published - 2015 |

### All Science Journal Classification (ASJC) codes

- Software
- Theoretical Computer Science

## Fingerprint Dive into the research topics of 'Semidefinite programming for chance constrained optimization over semialgebraic sets'. Together they form a unique fingerprint.

## Cite this

*SIAM Journal on Optimization*,

*25*(3), 1411-1440. https://doi.org/10.1137/140958736