MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Global Optimization with Polynomials

Author(s)
Han, Deren
Thumbnail
DownloadHPCES006.pdf (118.8Kb)
Metadata
Show full item record
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.
Date issued
2004-01
URI
http://hdl.handle.net/1721.1/3883
Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
Keywords
Polynomial Optimization Problems, Semidefinite Programming, Second-Order-Cone-Programming, LP relaxation

Collections
  • High Performance Computation for Engineered Systems (HPCES)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.