Semidefinite programming vs. LP relaxations for polynomial programming

JB Lasserre - Mathematics of operations research, 2002 - pubsonline.informs.org
We consider the global minimization of a multivariate polynomial on a semi-algebraic set Ω
defined with polynomial inequalities. We then compare two hierarchies of relaxations …

Semidefinite programming vs. LP relaxations for polynomial programming

JB Lasserre - Mathematics of Operations Research, 2002 - search.proquest.com
This paper considers the global minimization of a multivariate polynomial on a semi-
algebraic set Omega defined with polynomial inequalities. It then compares 2 hierarchies of …

Semidefinite Programming vs. LP Relaxations for Polynomial Programming

JB Lasserre - Mathematics of Operations Research, 2002 - dl.acm.org
We consider the global minimization of a multivariate polynomial on a semi-algebraic set Ω
defined with polynomial inequalities. We then compare two hierarchies of relaxations …

SEMIDEFINITE PROGRAMMING VS. LP RELAXATIONS FOR POLYNOMIAL PROGRAMMING.

JB Lasserre - Mathematics of Operations Research, 2002 - search.ebscohost.com
We consider the global minimization of a multivariate polynomial on a semi-algebraic set Ω
defined with polynomial inequalities. We then compare two hierarchies of relaxations …

Semidefinite Programming vs. LP Relaxations for Polynomial Programming

JB Lasserre - Mathematics of Operations Research, 2002 - cir.nii.ac.jp
抄録< jats: p> We consider the global minimization of a multivariate polynomial on a semi-
algebraic set Ω defined with polynomial inequalities. We then compare two hierarchies of …

[PDF][PDF] SEMIDEFINITE PROGRAMMING VS. LP RELAXATIONS FOR POLYNOMIAL PROGRAMMING

JB LASSERRE - MATHEMATICS OF OPERATIONS RESEARCH, 2002 - academia.edu
We consider the global minimization of a multivariate polynomial on a semi-algebraic set
defined with polynomial inequalities. We then compare two hierarchies of relaxations …

[PDF][PDF] SEMIDEFINITE PROGRAMMING VS. LP RELAXATIONS FOR POLYNOMIAL PROGRAMMING

JB LASSERRE - MATHEMATICS OF OPERATIONS …, 2002 - people.eecs.berkeley.edu
We consider the global minimization of a multivariate polynomial on a semi-algebraic set
defined with polynomial inequalities. We then compare two hierarchies of relaxations …

Semidefinite programming vs. LP relaxations for polynomial programming

JB Lasserre - Mathematics of Operations Research, 2002 - go.gale.com
We consider the global minimization of a multivariate polynomial on a semi-algebraic set
[OMEGA] defined with polynomial inequalities. We then compare two hierarchies of …

Semidefinite programming vs. LP relaxations for polynomial programming

JB Lasserre - Mathematics of Operations Research, 2002 - elibrary.ru
This paper considers the global minimization of a multivariate polynomial on a semi-
algebraic set Omega defined with polynomial inequalities. It then compares 2 hierarchies of …

Semidefinite Programming vs. LP Relaxations for Polynomial Programming

JB Lasserre - Mathematics of Operations Research, 2002 - JSTOR
We consider the global minimization of a multivariate polynomial on a semi-algebraic set Ω
defined with polynomial inequalities. We then compare two hierarchies of relaxations …