Global Optimization with Polynomials

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3883

Full metadata record

DC Field	Value	Language
dc.creator	Han, Deren	-
dc.date	2003-12-14T22:39:43Z	-
dc.date	2003-12-14T22:39:43Z	-
dc.date	2004-01	-
dc.date.accessioned	2013-10-09T02:32:56Z	-
dc.date.available	2013-10-09T02:32:56Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/3883	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.description	Singapore-MIT Alliance (SMA)	-
dc.format	121672 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	High Performance Computation for Engineered Systems (HPCES);	-
dc.subject	Polynomial Optimization Problems	-
dc.subject	Semidefinite Programming	-
dc.subject	Second-Order-Cone-Programming	-
dc.subject	LP relaxation	-
dc.title	Global Optimization with Polynomials	-
dc.type	Article	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI