Quadratic Programming Duality
Quadratic Programming Duality is a theoretical framework in mathematical optimization that establishes the relationship between a primal quadratic programming problem and its dual counterpart, characterized by the derivation of dual variables and Lagrangian symmetry to enable bounds, sensitivity analysis, and optimality conditions.
395
Publications
30K
Citations
658
Authors
373
Institutions
Publications per year
2017–2026
36
Parents
395
1–5 of 395
658
7
h-index
5
h-index
Centre d'études et de recherche en informatique et communications, France
5 publications · 202 citations
5
h-index
5
h-index
5
h-index
1–5 of 658
373
University of Iowa
Iowa City, United States
12 h-index
15 publications
1.9K citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
9 publications
476 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
12 publications
521 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
9 h-index
14 publications
969 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
9 publications
321 citations
Management Sciences (United States)
Albuquerque, United States
8 h-index
8 publications
950 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
8 h-index
11 publications
815 citations
Stanford University
Stanford, United States
7 h-index
7 publications
742 citations
1–8 of 373
57 publications · 6.6K citations
33
h-index
24 publications · 881 citations
20
h-index
21 publications · 1.1K citations
15
h-index
15 publications · 1.3K citations
12
h-index
10 publications · 468 citations
10
h-index
1–5