## Abstract

A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomial least square problem to polynomial semidefinite programs to reduce degrees of the polynomials are discussed. Computational efficiency of solving the original polynomial least squares problem and the transformed polynomial semidefinite programs is compared. Numerical results on selected polynomial least square problems show better computational performance of a transformed polynomial semidefinite program, especially when degrees of the polynomials are larger.

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

Pages (from-to) | 1-23 |

Number of pages | 23 |

Journal | Journal of Global Optimization |

Volume | 46 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2010 |

## Keywords

- Nonconvex optimization problems
- Polynomial least squares problems
- Polynomial second-order cone programs
- Polynomial semidefinite programs
- Sparsity