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

Authors

658

  1. IM
    Immanuel M. Bomze

    University of Vienna, Austria

    5 publications · 221 citations

    7

    h-index

  2. DL
    Duan Li

    Chinese University of Hong Kong, Hong Kong SAR China

    5 publications · 128 citations

    5

    h-index

  3. AB
    Alain Billionnet

    Centre d'études et de recherche en informatique et communications, France

    5 publications · 202 citations

    5

    h-index

  4. TT
    Tamás Terlaky

    Delft University of Technology, Netherlands

    4 publications · 550 citations

    5

    h-index

  5. PM
    Pãnos M. Pardalos

    University of Florida, United States

    5 publications · 427 citations

    5

    h-index

1–5 of 658

Venues

  1. Mathematical Programming

    57 publications · 6.6K citations

    33

    h-index

  2. Journal of Global Optimization

    24 publications · 881 citations

    20

    h-index

  3. European Journal of Operational Research

    21 publications · 1.1K citations

    15

    h-index

  4. Journal of Optimization Theory and Applications

    15 publications · 1.3K citations

    12

    h-index

  5. Computational Optimization and Applications

    10 publications · 468 citations

    10

    h-index

1–5