Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Christine Bachoc & Dion C. Gijswijt & Alexander Schrijver & Frank Vallentin, 2012. "Invariant Semidefinite Programs," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 219-269, Springer.
- Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
- Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
- Renata Sotirov, 2018. "Graph bisection revisited," Annals of Operations Research, Springer, vol. 265(1), pages 143-154, June.
- Etienne Klerk & Fernando M. Oliveira Filho & Dmitrii V. Pasechnik, 2012. "Relaxations of Combinatorial Problems Via Association Schemes," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 171-199, Springer.
- Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
- de Klerk, E. & Sotirov, R., 2007.
"Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem,"
Discussion Paper
2007-44, Tilburg University, Center for Economic Research.
- de Klerk, E. & Sotirov, R., 2010. "Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem," Other publications TiSEM 73287c80-3bc2-40c4-b02d-4, Tilburg University, School of Economics and Management.
- de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Other publications TiSEM 87a5d126-86e5-4863-8ea5-1, Tilburg University, School of Economics and Management.
- Truetsch, U., 2014. "A semidefinite programming based branch-and-bound framework for the quadratic assignment problem," Other publications TiSEM ff97cfea-a5da-41e0-8316-0, Tilburg University, School of Economics and Management.
- Qing Zhao & Stefan E. Karisch & Franz Rendl & Henry Wolkowicz, 1998. "Semidefinite Programming Relaxations for the Quadratic Assignment Problem," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 71-109, March.
- Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz, 2021. "A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 853-891, April.
- Hao Hu & Renata Sotirov, 2020. "On Solving the Quadratic Shortest Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 219-233, April.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- E. R. van Dam & R. Sotirov, 2015.
"On Bounding the Bandwidth of Graphs with Symmetry,"
INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 75-88, February.
- van Dam, E.R. & Sotirov, R., 2015. "On bounding the bandwidth of graphs with symmetry," Other publications TiSEM 180849f1-e7d3-44d9-8424-5, Tilburg University, School of Economics and Management.
- Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
- Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz, 2021. "A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 853-891, April.
- Brosch, Daniel & de Klerk, Etienne, 2021. "Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software," Other publications TiSEM 283da78a-b42f-47b4-b2b7-2, Tilburg University, School of Economics and Management.
- Samuel Burer & Kyungchan Park, 2024. "A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 320-339, July.
- E. de Klerk & R. Sotirov & U. Truetsch, 2015. "A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 378-391, May.
- de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007.
"On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96),"
Discussion Paper
2007-101, Tilburg University, Center for Economic Research.
- de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Other publications TiSEM 12999d3d-956a-4660-9ae4-5, Tilburg University, School of Economics and Management.
- de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
- Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.
- José F. S. Bravo Ferreira & Yuehaw Khoo & Amit Singer, 2018. "Semidefinite programming approach for the quadratic assignment problem with a sparse graph," Computational Optimization and Applications, Springer, vol. 69(3), pages 677-712, April.
- de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008.
"On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101),"
Discussion Paper
2008-96, Tilburg University, Center for Economic Research.
- de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2008. "On Semidefinite Programming Relaxations of the Traveling Salesman Problem (revision of DP 2007-101)," Other publications TiSEM ea23cd70-a3b1-401a-aa3f-0, Tilburg University, School of Economics and Management.
- Naomi Graham & Hao Hu & Jiyoung Im & Xinxin Li & Henry Wolkowicz, 2022. "A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2125-2143, July.
- Yichuan Ding & Dongdong Ge & Henry Wolkowicz, 2011. "On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 88-104, February.
- Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
- Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
- Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga, 2019. "Alternative SDP and SOCP approximations for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 153-175, June.
- Campos, Juan S. & Misener, Ruth & Parpas, Panos, 2019. "A multilevel analysis of the Lasserre hierarchy," European Journal of Operational Research, Elsevier, vol. 277(1), pages 32-41.
- Michele Garraffa & Federico Della Croce & Fabio Salassa, 2017. "An exact semidefinite programming approach for the max-mean dispersion problem," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 71-93, July.
- Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
- Adrien Durand & Timothé Watteau & Georges Ghazi & Ruxandra Mihaela Botez, 2024. "Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs," Mathematics, MDPI, vol. 12(19), pages 1-24, September.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:8dd3dbae-58fd-4238-b786-eccfacc3a300. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.