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
Parents
2.2K
Lieven Vandenberghe, Stephen Boyd · SIAM Review · 1996 · 4.1K citations
On the Implementation of a Primal-Dual Interior Point Method
Sanjay Mehrotra · SIAM Journal on Optimization · 1992 · 1.6K citations
1–5 of 2.2K
3.7K
20
h-index
19
h-index
17
h-index
16
h-index
15
h-index
1–5 of 3.7K
1.2K

Cornell University
Ithaca, United States
31 h-index
59 publications
7.1K citations
Microsoft (United States)
Redmond, United States
29 h-index
62 publications
3.6K citations
Georgia Institute of Technology
Atlanta, United States
28 h-index
95 publications
8.2K citations

Centre National de la Recherche Scientifique
Paris, France
26 h-index
82 publications
10.7K citations
Massachusetts Institute of Technology
Cambridge, United States
26 h-index
54 publications
2.7K citations

Delft University of Technology
Delft, The Netherlands
26 h-index
85 publications
4.4K citations
University of California, Los Angeles
Los Angeles, United States
25 h-index
63 publications
4.8K citations
Princeton University
Princeton, United States
23 h-index
58 publications
3.6K citations
1–8 of 1.2K
120 publications · 14.2K citations
54
h-index
135 publications · 14.3K citations
52
h-index
Repository · 132 publications · 3.9K citations
33
h-index
55 publications · 3.3K citations
28
h-index
53 publications · 2.9K citations
27
h-index
1–5