Primal-dual Algorithms

Primal-Dual Algorithms is a class of optimization methods in quadratic programming that simultaneously solve the primal and dual formulations of a problem by iteratively updating both primal and dual variables to achieve convergence to an optimal solution.

2.2K

Publications

144.5K

Citations

3.7K

Authors

1.2K

Institutions

Publications per year

2017–2026

574

Authors

3.7K

  1. CR
    C. Roos

    Delft University of Technology, Netherlands

    24 publications · 2.1K citations

    20

    h-index

  2. RD
    Renato D. C. Monteiro

    Georgia Institute of Technology, United States

    22 publications · 2.2K citations

    19

    h-index

  3. MJ
    Michael J. Todd

    Cornell University, United States

    19 publications · 2.9K citations

    17

    h-index

  4. JG
    Jacek Gondzio

    University of Edinburgh, United Kingdom

    22 publications · 1.5K citations

    16

    h-index

  5. MH
    Mingyi Hong

    University of Minnesota, United States

    17 publications · 780 citations

    15

    h-index

1–5 of 3.7K

Venues

  1. Mathematical Programming

    120 publications · 14.2K citations

    54

    h-index

  2. SIAM Journal on Optimization

    135 publications · 14.3K citations

    52

    h-index

  3. arXiv (Cornell University)

    Repository · 132 publications · 3.9K citations

    33

    h-index

  4. Optimization methods & software

    55 publications · 3.3K citations

    28

    h-index

  5. Journal of Optimization Theory and Applications

    53 publications · 2.9K citations

    27

    h-index

1–5