Lagrangian Duality

Lagrangian Duality is a theoretical framework in convex analysis and unconstrained optimization that associates a primal optimization problem with a dual problem by introducing Lagrange multipliers to incorporate constraints into the objective function, thereby enabling the derivation of lower bounds on the optimal value and establishing duality relations through the Lagrangian function.

1.3K

Publications

77.6K

Citations

2K

Authors

861

Institutions

Publications per year

2017–2026

205

Authors

2K

  1. VJ
    V. Jeyakumar

    UNSW Sydney, Australia

    17 publications · 719 citations

    15

    h-index

  2. XY
    Xiaoqi Yang

    Hong Kong Polytechnic University, Hong Kong SAR China

    21 publications · 688 citations

    15

    h-index

  3. RT
    R. T. Rockafellar

    University of Washington, United States

    12 publications · 1.4K citations

    12

    h-index

  4. RI
    Radu Ioan Boţ

    Chemnitz University of Technology, Germany

    12 publications · 451 citations

    12

    h-index

  5. IS
    Ivan Singer

    Romanian Academy, Romania

    11 publications · 179 citations

    11

    h-index

1–5 of 2K

Venues

  1. Mathematical Programming

    97 publications · 7.3K citations

    43

    h-index

  2. Journal of Optimization Theory and Applications

    120 publications · 4.6K citations

    40

    h-index

  3. SIAM Journal on Optimization

    47 publications · 3.2K citations

    33

    h-index

  4. Journal of Mathematical Analysis and Applications

    64 publications · 2.7K citations

    30

    h-index

  5. Journal of Global Optimization

    50 publications · 1.3K citations

    24

    h-index

1–5