A restricted dual peaceman-rachford splitting method for a strengthened DNN relaxation for QAP
Year of publication: |
2022
|
---|---|
Authors: | Graham, Naomi ; Hu, Hao ; Im, Jiyoung ; Li, Xinxin ; Wolkowicz, Henry |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 4, p. 2125-2143
|
Subject: | doubly nonnegative relaxation | facial reduction | Peaceman-Rachford splitting method | quadratic assignment problem | semidefinite relaxation | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Li, Min, (2015)
-
Meijer, Frank de, (2021)
-
A relaxed-certificate facial reduction algorithm based on subspace intersection
Friberg, Henrik A., (2016)
- More ...
-
A strengthened Barvinok-Pataki bound on SDP rank
Im, Jiyoung, (2021)
-
A semismooth newton-type method for the nearest doubly stochastic matrix problem
Hu, Hao, (2024)
-
A low-dimensional semidefinite relaxation for the quadratic assignment problem
Ding, Yichuan, (2009)
- More ...