Suchergebnisse - "Complex semidefinite programming"

Certified and accurate SDP bounds for the ACOPF problem von Oustry, Antoine, D’Ambrosio, Claudia, Liberti, Leo, Ruiz, Manuel

“… We propose a new method for improving the bound tightness of the popular semidefinite programming (SDP) relaxation for the ACOPF introduced in Lavaei and Low …”
Volltext

Cuts and semidefinite liftings for the complex cut polytope von Sinjorgo, Lennart, Sotirov, Renata, Anjos, Miguel F.

“… We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $$xx^\textrm{H}$$ x x H , where the elements of $$x \in \mathbb {C}^n$$ x ∈ …”
Volltext

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis von Sun, Jian, Zhang, Zan-Bo, Chen, Yannan, Han, Deren, Du, Donglei, Zhang, Xiaoyan

“… We consider the max hypergraph 3-cut problem with limited unbalance (MH3C-LU). The objective is to divide the vertex set of an edge-weighted hypergraph H = ( V …”
Volltext

On approximating complex quadratic optimization problems via semidefinite programming relaxations von So, Anthony Man-Cho, Zhang, Jiawei, Ye, Yinyu

“… In this paper the authors study semidefinite programming (SDP) models for a class of discrete and continuous quadratic optimization problems in the complex …”
Volltext

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding von Wu, Chenchen, Xu, Dachuan, Du, Donglei, Xu, Wenqing

“… Graph partition problems have been investigated extensively in combinatorial optimization. In this work, we consider an important graph partition problem which …”
Volltext