View : 27 Download: 0

Second Order Cone Relaxation of Polynomial Optimization Problems with the Ball Constraint

Title
Second Order Cone Relaxation of Polynomial Optimization Problems with the Ball Constraint
Authors
Lee, Min-Kyoung
Issue Date
2004
Department/Major
대학원 수학과
Publisher
The Graduate School of Ewha Womans University
Degree
Master
Advisors
Kim, Sunyoung
Abstract
Solving polynomial optimization problems(POPs) over cones has become anessential subject in recent developments. The second order cone programming(SOCP) relaxation methods have been known for efficiency when providing lower bounds for optimal values of POPs. We present a new SOCP relaxation that can give the exact optimal object values for POPs of diagonally dominant coefficient matrix if ball constraint is added. Key words. polynomial optimization problems, semidefinite program, second order cone program, quadratic program, ball constraint.
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