## Abstract

Sequences of generalized Lagrangian duals and their sums of squares (SOS) of polynomials relaxations for a polynomial optimization problem (POP) are introduced. The sparsity of polynomials in the POP is used to reduce the sizes of the Lagrangian duals and their SOS relaxations. It is proved that the optimal values of the Lagrangian duals in the sequence converge to the optimal value of the POP using a method from the penalty function approach. The sequence of SOS relaxations is transformed into a sequence of semidefinite programing (SDP) relaxations of the POP, which correspond to duals of modification and generalization of SDP relaxations given by Lasserre for the POP.

Original language | English |
---|---|

Pages (from-to) | 697-719 |

Number of pages | 23 |

Journal | SIAM Journal on Optimization |

Volume | 15 |

Issue number | 3 |

DOIs | |

State | Published - 2005 |

## Keywords

- Global optimization
- Lagrangian dual
- Lagrangian relaxation
- Polynomial optimization problem
- Semidefinite program
- Semidefinite program relaxation
- Sparsity
- Sums of squares optimization