View : 47 Download: 0

Strengthening Semidefinite Programming Relaxations of Polynomial Optimization Problems

Title
Strengthening Semidefinite Programming Relaxations of Polynomial Optimization Problems
Authors
Kim, Jin Sun
Issue Date
2005
Department/Major
대학원 수학과
Keywords
Polynomial optimization problem, Convex envelope, Branch-and-bound, Semidefinite program
Publisher
이화여자대학교 대학원
Degree
Master
Advisors
김선영
Abstract
Solving polynomial optimization problems (POPs) has become an essential subject in recent developments. When large scale POPs are solved using the branch-and-bound method, it is necessary to have proper convex relaxations for the framework of the branch-and-bound method. Semidefinite program (SDP) relaxations suitable to the framework of branch-and-bound method are proposed. We add linear constraints obtained by partitioning the feasible region into the Cartesian product of two-dimensional triangles and rectangles. The usefulness of these new relaxation is demonstrated computationally.
Fulltext
Show the fulltext
Appears in Collections:
일반대학원 > 수학과 > Theses_Master
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE