IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/283da78a-b42f-47b4-b2b7-260355dd7b3c.html
   My bibliography  Save this paper

Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software

Author

Listed:
  • Brosch, Daniel

    (Tilburg University, School of Economics and Management)

  • de Klerk, Etienne

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:tiu:tiutis:283da78a-b42f-47b4-b2b7-260355dd7b3c
    as

    Download full text from publisher

    File URL: https://repository.tilburguniversity.edu/bitstreams/17b9d320-46e2-4a1b-aa31-13ce38f01b22/download
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. de Klerk, E. & Newman, M.W. & Pasechnik, D.V. & Sotirov, R., 2006. "On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs," Other publications TiSEM 02d54f89-8fd8-4983-b514-b, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. Hu, Hao & Sotirov, Renata & Wolkowicz, Henry, 2023. "Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs," Other publications TiSEM 8dd3dbae-58fd-4238-b786-e, Tilburg University, School of Economics and Management.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Fanz Rendl & Renata Sotirov, 2018. "The min-cut and vertex separator problem," Computational Optimization and Applications, Springer, vol. 69(1), pages 159-187, January.
    11. 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.
    12. 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.
    13. 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.
    14. Godai Azuma & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita, 2023. "Exact SDP relaxations for quadratic programs with bipartite graph structures," Journal of Global Optimization, Springer, vol. 86(3), pages 671-691, July.
    15. 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.
    16. Yong Xia & Wajeb Gharibi, 2015. "On improving convex quadratic programming relaxation for the quadratic assignment problem," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 647-667, October.
    17. Kristijan Cafuta, 2019. "Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 397-413, June.
    18. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
    19. Cordian Riener & Thorsten Theobald & Lina Jansson Andrén & Jean B. Lasserre, 2013. "Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 122-141, February.
    20. Sungwoo Park & Dianne P. O’Leary, 2015. "A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 558-571, August.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:283da78a-b42f-47b4-b2b7-260355dd7b3c. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.