ویراساینس.
سند علمی

On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

Yichuan Ding, Dongdong Ge, Henry Wolkowicz

چکیده

We analyze two popular semidefinite programming relaxations for quadratically constrained quadratic programs with matrix variables. These relaxations are based on vector lifting and on matrix lifting; they are of different size and expense. We prove, under mild assumptions, that these two relaxations provide equivalent bounds. Thus, our results provide a theoretical guideline for how to choose a less expensive semidefinite programming relaxation and still obtain a strong bound. The main technique used to show the equivalence and that allows for the simplified constraints is the recognition of a class of nonchordal sparse patterns that admit a smaller representation of the positive semidefinite constraint.

اسناد مشابه

  • On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

    مقاله‌ی دسترسی آزاد۲۰۱۱Mathematics of Operations ResearchYichuanDing, DongdongGe, HenryWolkowicz

  • Exploiting semidefinite relaxations in constraint programming

    سند علمی۲۰۰۶Computers & ORWillem Jan van Hoeve

    Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming. In principle, we use the solution of a semid

  • Semidefinite Relaxations for Integer Programming

    سند علمی۲۰۱۰50 Years of Integer ProgrammingFranz Rendl

    We survey some recent developments in the area of semidefinite optimization applied to integer programming. After recalling some generic modeling techniques to obtain semidefinite relaxations for NP-hard problems, we look at the theoretical power of semidefinite optimization in t

  • Quadratic Matrix Programming

    سند علمی۲۰۰۷SIAM Journal on OptimizationAmir Beck

    We introduce and study a special class of nonconvex quadratic problems in which the objective and constraint functions have the form f(X) = Tr(XAX)+2Tr(BX)+c,X ∈ RRn×r. The latter formulation is termed quadratic matrix programming (QMP) of order r. We construct a specially devise

  • How to Understand LMMSE Transceiver Design for MIMO Systems From Quadratic Matrix Programming

    سند علمی۲۰۱۳CoRRChengwen Xing, Shuo Li, Zesong Fei, Jingming Kuang

    In this paper, a unified linear minimum mean-square-error (LMMSE) transceiver design framework is investigated, which is suitable for a wide range of wireless systems. The unified design is based on an elegant and powerful mathematical programming technology termed as quadratic m

  • Exploiting semidefinite relaxations in constraint programming

    مقاله‌ی دسترسی آزاد۲۰۰۶Computers & Operations ResearchWillem-Janvan Hoeve