SOLUTIONS OF NONCONVEX QUADRATIC OPTIMIZATION PROBLEMS VIA DIAGONALIZATION

  • YU, MOONSOOK (Department of Mathematics, Ewha Womans University) ;
  • KIM, SUNYOUNG (Department of Mathematics, Ewha Womans University)
  • Published : 2001.12.31

Abstract

Nonconvex Quadratic Optimization Problems (QOP) are solved approximately by SDP (semidefinite programming) relaxation and SOCP (second order cone programmming) relaxation. Nonconvex QOPs with special structures can be solved exactly by SDP and SOCP. We propose a method to formulate general nonconvex QOPs into the special form of the QOP, which can provide a way to find more accurate solutions. Numerical results are shown to illustrate advantages of the proposed method.

Acknowledgement

Supported by : Kosef