A specialized simplex algorithm accelerates budget-constrained total variation regularized linear programs on graphs by using rooted spanning forest characterizations of basic solutions.
Efficient solution of discrete subproblems arising in integer optimal control with total variation regularization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Specialized Simplex Algorithm for Budget-Constrained Total Variation-Regularized Problems
A specialized simplex algorithm accelerates budget-constrained total variation regularized linear programs on graphs by using rooted spanning forest characterizations of basic solutions.