ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

Source URL: homepages.cwi.nl

Laurent Polynomial Moment Problem: A Case Study Fedor Pakovich, Christian Pech, and Alexander K. Zvonkin Abstract. In recent years, the so-called polynomial moment problem, motivated by the classical Poincar´ e center-f

Source URL: www.labri.fr

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

Source URL: homepages.cwi.nl

AMOEBAS OF GENUS AT MOST ONE THORSTEN THEOBALD AND TIMO DE WOLFF Abstract. The amoeba of a Laurent polynomial f ∈ C[z1±1 , . . . , zn±1 ] is the image of its zero set V(f ) under the log-absolute-value map. Understan

Source URL: www.math.uni-frankfurt.de

• Mathematics
• Algebra
• Mathematical analysis
• Algebraic geometry
• Amoeba
• Polynomials
• Field theory
• Complex analysis
• Operator theory
• Julia set
• Fundamental theorem of algebra

Formal Proofs for Taylor Models in Coq Ioana Paşca LIP, ENS Lyon joint work with Nicolas Brisebarre, Mioara Joldeş, Erik Martin-Dorel, Micaela Mayero, Jean-Michel Muller, Laurence Rideau & Laurent Théry

Source URL: raim2012.u-bourgogne.fr

• Mathematical analysis
• Mathematics
• Numerical analysis
• Algebra
• Polynomial
• Taylor series
• Interval arithmetic

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

Source URL: homepages.cwi.nl

• Mathematics
• Algebra
• Real algebraic geometry
• Mathematical optimization
• Operations research
• Matrices
• Linear programming
• Semidefinite programming
• Polynomial
• Moment problem
• Moment matrix
• Matrix

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ May 8, 2008 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and

Source URL: homepages.cwi.nl

.5cm. Computing real radical ideals and real roots of polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski

Source URL: homepages.cwi.nl

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

Source URL: homepages.cwi.nl

.5cm. Real solving polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski LAAS, Toulouse - CWI, Amsterdam - ETH, Z¨urich

Source URL: homepages.cwi.nl