Global Optimization with Polynomials
Name
HPCES006.pdf
Size
118.82 KB
Format
Adobe PDF
Checksum (MD5)
9df628c469f76581bb70ccdd3f57cc45
Author(s)
Han, Deren
Date Issued
January 2004
Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
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.
Subjects
Polynomial Optimization Problems
Semidefinite Programming
Second-Order-Cone-Programming
LP relaxation
Persistent DSpace Link
