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
Parents
1.4K
Semidefinite Relaxation of Quadratic Optimization Problems
Zhi‐Quan Luo, Wing‐Kin Ma, Anthony Man–Cho So et al. · IEEE Signal Processing Magazine · 2010 · 3.6K citations
1–5 of 1.4K
2.6K
22
h-index
18
h-index
Laboratoire d'Analyse et d'Architecture des Systèmes, France
24 publications · 2.2K citations
18
h-index
17
h-index
Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
17 publications · 3K citations
15
h-index
1–5 of 2.6K
814
Princeton University
Princeton, United States
33 h-index
76 publications
9.8K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
32 h-index
90 publications
7.9K citations

Southeast University
Nanjing, China
26 h-index
83 publications
4.9K citations

University of Minnesota
Minneapolis, United States
25 h-index
63 publications
6.3K citations

Xidian University
Xi'an, China
25 h-index
70 publications
6.1K citations

University of Waterloo
Waterloo, Canada
24 h-index
49 publications
4.3K citations
Massachusetts Institute of Technology
Cambridge, United States
24 h-index
82 publications
3.6K citations
University of California, Berkeley
Berkeley, United States
24 h-index
63 publications
4.9K citations
1–8 of 814
90 publications · 11.9K citations
52
h-index
66 publications · 6.4K citations
39
h-index
60 publications · 7.5K citations
37
h-index
56 publications · 4.3K citations
35
h-index
52 publications · 3.1K citations
29
h-index
1–5