Derives accessible O(κΦ ln(κΦ ||w*||/ε)) iteration bound for rPDHG on unique-optima LPs, with computable Φ, two-stage performance, and equivalence to stability and sharpness.
https://community.fico.com/s/blog-post/ a5QQi0000019II5MAM/fico4824
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer
Derives accessible O(κΦ ln(κΦ ||w*||/ε)) iteration bound for rPDHG on unique-optima LPs, with computable Φ, two-stage performance, and equivalence to stability and sharpness.