Semidefinite Programming is a subfield of convex optimization that generalizes linear programming by optimizing a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine subspace.
3.3K
Publications
249K
Citations
5K
Authors
1.4K
Institutions
Publications per year
2017–2026
983
Publications
3.3K
1–5 of 3.3K
Authors
5K
- SB
30
h-index
- KT
23
h-index
- JBJean B. Lasserre
Laboratoire d'Analyse et d'Architecture des Systèmes, France
37 publications · 2.7K citations
23
h-index
- PAPablo A. Parrilo
Massachusetts Institute of Technology, United States
34 publications · 4.8K citations
23
h-index
- SZ
22
h-index
1–5 of 5K
Institutions
1.4K
Massachusetts Institute of Technology
Cambridge, United States
50 h-index
201 publications
18.9K citations
Stanford University
Stanford, United States
50 h-index
191 publications
44.9K citations
Princeton University
Princeton, United States
41 h-index
111 publications
11.2K citations
National University of Singapore
Singapore, Singapore
40 h-index
134 publications
13.9K citations
University of California, Berkeley
Berkeley, United States
37 h-index
123 publications
9.9K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
37 h-index
124 publications
10K citations
California Institute of Technology
Pasadena, United States
36 h-index
112 publications
12.6K citations
University of Waterloo
Waterloo, Canada
36 h-index
124 publications
6.8K citations
1–8 of 1.4K
Venues
- SIAM Journal on Optimization
195 publications · 20.5K citations
73
h-index
- IEEE Transactions on Signal Processing
137 publications · 13.8K citations
64
h-index
- Mathematical Programming
142 publications · 13.4K citations
55
h-index
- IEEE Transactions on Power Systems
48 publications · 4.9K citations
37
h-index
- IEEE Transactions on Automatic Control
75 publications · 4.9K citations
37
h-index
1–5