Regression models fit observed LP solver runtimes well within instance classes, but asymptotic growth rates differ substantially across simplex, interior-point, and PDHG methods.
A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40:120–145, 2011
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Empirical Asymptotic Runtime Analysis of Linear Programming Algorithms
Regression models fit observed LP solver runtimes well within instance classes, but asymptotic growth rates differ substantially across simplex, interior-point, and PDHG methods.