Semidefinite Programming Relaxation

Semidefinite Programming Relaxation is a convex optimization technique that generalizes linear programming relaxation by replacing non-convex quadratic constraints with positive semidefinite matrix constraints, enabling tighter approximations for combinatorial optimization problems.

1.4K

Publications

99.8K

Citations

2.6K

Authors

814

Institutions

Publications per year

2017–2026

517

Variants

Sdp Relaxation

Authors

2.6K

  1. WM
    Wing‐Kin Ma

    Chinese University of Hong Kong, Hong Kong SAR China

    27 publications · 6K citations

    22

    h-index

  2. DW
    Derrick Wing Kwan Ng

    UNSW Sydney, Australia

    20 publications · 3.3K citations

    18

    h-index

  3. JB
    Jean B. Lasserre

    Laboratoire d'Analyse et d'Architecture des Systèmes, France

    24 publications · 2.2K citations

    18

    h-index

  4. ZL
    Zhi‐Quan Luo

    University of Minnesota, United States

    19 publications · 5.3K citations

    17

    h-index

  5. RS
    Robert Schober

    Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany

    17 publications · 3K citations

    15

    h-index

1–5 of 2.6K

Venues

  1. IEEE Transactions on Signal Processing

    90 publications · 11.9K citations

    52

    h-index

  2. SIAM Journal on Optimization

    66 publications · 6.4K citations

    39

    h-index

  3. Mathematical Programming

    60 publications · 7.5K citations

    37

    h-index

  4. IEEE Transactions on Wireless Communications

    56 publications · 4.3K citations

    35

    h-index

  5. IEEE Transactions on Vehicular Technology

    52 publications · 3.1K citations

    29

    h-index

1–5