A strengthened Barvinok-Pataki bound on SDP rank
Year of publication: |
2021
|
---|---|
Authors: | Im, Jiyoung ; Wolkowicz, Henry |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 837-841
|
Subject: | Barvinok-Pataki bound | Facial reduction | Rank | Semidefinite programming | Singularity degree | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ranking-Verfahren | Ranking method |
-
Rational and real positive semidefinite rank can be different
Fawzi, Hamza, (2016)
-
Meijer, Frank de, (2021)
-
Mirka, Renee, (2024)
- More ...
-
A restricted dual peaceman-rachford splitting method for a strengthened DNN relaxation for QAP
Graham, Naomi, (2022)
-
A low-dimensional semidefinite relaxation for the quadratic assignment problem
Ding, Yichuan, (2009)
-
On equivalence of semidefinite relaxations for quadratic matrix programming
Ding, Yichuan, (2011)
- More ...