A primal interior point method, accelerated by preconditioned iterative solvers, can outperform primal-dual IPM in the final iterations of many linear and semidefinite programs.
Inexact constraint preconditioners for linear systems arising in interior point methods.Computational Optimization and Applications, 36:137– 147, 2007
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?
A primal interior point method, accelerated by preconditioned iterative solvers, can outperform primal-dual IPM in the final iterations of many linear and semidefinite programs.