Laurent polynomial

Results: 17



#Item
1ON 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

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

Add to Reading List

Source URL: homepages.cwi.nl

Language: English - Date: 2011-06-06 01:41:37
    2Laurent 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

    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

    Add to Reading List

    Source URL: www.labri.fr

    Language: English - Date: 2010-06-04 07:03:24
      3SUMS 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

      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

      Add to Reading List

      Source URL: homepages.cwi.nl

      Language: English - Date: 2010-02-06 15:22:54
        4AMOEBAS 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

        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

        Add to Reading List

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

        Language: English - Date: 2013-05-18 09:37:46
        5Formal 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

        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

        Add to Reading List

        Source URL: raim2012.u-bourgogne.fr

        Language: English - Date: 2012-07-16 09:24:56
        6SUMS 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

        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

        Add to Reading List

        Source URL: homepages.cwi.nl

        Language: English - Date: 2010-02-06 15:22:54
        7SUMS 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

        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

        Add to Reading List

        Source URL: homepages.cwi.nl

        Language: English - Date: 2009-01-14 16:33:25
          8.5cm. Computing real radical ideals and real roots of polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski

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

          Add to Reading List

          Source URL: homepages.cwi.nl

          Language: English - Date: 2009-10-05 04:14:04
            9ON 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

            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

            Add to Reading List

            Source URL: homepages.cwi.nl

            Language: English - Date: 2011-06-06 01:41:37
              10.5cm. Real solving polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski LAAS, Toulouse - CWI, Amsterdam - ETH, Z¨urich

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

              Add to Reading List

              Source URL: homepages.cwi.nl

              Language: English - Date: 2008-06-02 03:39:33