A linear program is solved by minimizing a single convex twice-differentiable function whose zero set equals the primal-dual optimal solution set.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving a linear program via a single unconstrained minimization
A linear program is solved by minimizing a single convex twice-differentiable function whose zero set equals the primal-dual optimal solution set.