On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
Year of publication: |
2024
|
---|---|
Authors: | Han, Shaoning ; Zhang, Xinyao ; Pang, Jong-Shi |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 53.2024, Art.-No. 107091, p. 1-7
|
Subject: | Convex quadratic programs | Iteration complexity | Leontief matrices | Linear complementarity problems | Linear programs | Simplex methods | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
Drori, Yoel, (2015)
-
Li, Min, (2015)
-
He, Bingsheng, (2017)
- More ...
-
Sun, Qianjin, (2022)
-
Han, Shaoning, (2022)
-
On linear programs with linear complementarity constraints
Hu, Jing, (2012)
- More ...