### Abstract

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

Title of host publication | Handbook on Semidefinite, Cone and Polynomial Optimization |

Editors | M.F. Anjos, J.B. Lasserre |

Place of Publication | Amsterdam |

Publisher | Elsevier |

Pages | 25-60 |

Number of pages | 957 |

ISBN (Print) | 9781461407683 |

Publication status | Published - 2012 |

### Publication series

Name | International Series in Operations Research & Management Science |
---|---|

Number | 166 |

### Fingerprint

### Cite this

*Handbook on Semidefinite, Cone and Polynomial Optimization*(pp. 25-60). (International Series in Operations Research & Management Science; No. 166). Amsterdam: Elsevier.

}

*Handbook on Semidefinite, Cone and Polynomial Optimization.*International Series in Operations Research & Management Science, no. 166, Elsevier, Amsterdam, pp. 25-60.

**The approach of moments for polynomial equations.** / Laurent, M.; Rostalski, P.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review

TY - CHAP

T1 - The approach of moments for polynomial equations

AU - Laurent, M.

AU - Rostalski, P.

N1 - Pagination: 957

PY - 2012

Y1 - 2012

N2 - In this chapter we present the moment based approach for computing all real solutions of a given system of polynomial equations. This approach builds upon a lifting method for constructing semidefinite relaxations of several nonconvex optimization problems, using sums of squares of polynomials and the dual theory of moments. A crucial ingredient is a semidefinite characterization of the real radical ideal, consisting of all polynomials with the same real zero set as the system of polynomials to be solved. Combining this characterization with ideas from commutative algebra, (numerical) linear algebra and semidefinite optimization yields a new class of real algebraic algorithms. This chapter sheds some light on the underlying theory and the link to polynomial optimization.

AB - In this chapter we present the moment based approach for computing all real solutions of a given system of polynomial equations. This approach builds upon a lifting method for constructing semidefinite relaxations of several nonconvex optimization problems, using sums of squares of polynomials and the dual theory of moments. A crucial ingredient is a semidefinite characterization of the real radical ideal, consisting of all polynomials with the same real zero set as the system of polynomials to be solved. Combining this characterization with ideas from commutative algebra, (numerical) linear algebra and semidefinite optimization yields a new class of real algebraic algorithms. This chapter sheds some light on the underlying theory and the link to polynomial optimization.

M3 - Chapter

SN - 9781461407683

T3 - International Series in Operations Research & Management Science

SP - 25

EP - 60

BT - Handbook on Semidefinite, Cone and Polynomial Optimization

A2 - Anjos, M.F.

A2 - Lasserre, J.B.

PB - Elsevier

CY - Amsterdam

ER -