dc.contributor.author | Han, Deren | |
dc.date.accessioned | 2003-12-14T22:39:43Z | |
dc.date.available | 2003-12-14T22:39:43Z | |
dc.date.issued | 2004-01 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/3883 | |
dc.description.abstract | The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0 - 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-valued polynomial p(x) : Rn â R, as well the constraint case: minimize p(x) on a semialgebraic set K, i.e., a set defined by polynomial equalities and inequalities. We also summarize some questions that we are currently considering. | en |
dc.description.sponsorship | Singapore-MIT Alliance (SMA) | en |
dc.format.extent | 121672 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.relation.ispartofseries | High Performance Computation for Engineered Systems (HPCES); | |
dc.subject | Polynomial Optimization Problems | en |
dc.subject | Semidefinite Programming | en |
dc.subject | Second-Order-Cone-Programming | en |
dc.subject | LP relaxation | en |
dc.title | Global Optimization with Polynomials | en |
dc.type | Article | en |