Convex Quadratic Programming
Convex Quadratic Programming is a type of mathematical optimization problem in which a convex quadratic function is minimized over a set of linear constraints, distinguishing it from non-convex variants by guaranteeing a globally optimal solution due to the convexity of the objective function and feasible region.
1K
Publications
75.9K
Citations
1.9K
Authors
725
Institutions
Publications per year
2017–2026
230
Variants
Convex Qp
Parents
1K
1–5 of 1K
1.9K
14
h-index
10
h-index
10
h-index
10
h-index
10
h-index
1–5 of 1.9K
725
Stanford University
Stanford, United States
19 h-index
45 publications
12.9K citations
University of Iowa
Iowa City, United States
18 h-index
24 publications
2.4K citations
Princeton University
Princeton, United States
18 h-index
26 publications
1.7K citations
National University of Singapore
Singapore, Singapore
16 h-index
29 publications
2.7K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
16 h-index
25 publications
2.1K citations
University of Wisconsin–Madison
Madison, United States
15 h-index
26 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
24 publications
2.1K citations
Management Sciences (United States)
Albuquerque, United States
14 h-index
16 publications
1.2K citations
1–8 of 725
82 publications · 7.2K citations
45
h-index
70 publications · 5.4K citations
35
h-index
19 publications · 1.4K citations
18
h-index
28 publications · 1.6K citations
18
h-index
21 publications · 887 citations
16
h-index
1–5