Global Optimization with Polynomials
Author(s)
Han, Deren
DownloadHPCES006.pdf (118.8Kb)
Metadata
Show full item recordAbstract
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.
Date issued
2004-01Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
Keywords
Polynomial Optimization Problems, Semidefinite Programming, Second-Order-Cone-Programming, LP relaxation