A primal-dual smoothing reformulation converts discrete binary optimization into a continuous minimax problem solved by a convergent simultaneous gradient descent-ascent algorithm.
The gset dataset
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
-
Smoothing Binary Optimization: A Primal-Dual Perspective
A primal-dual smoothing reformulation converts discrete binary optimization into a continuous minimax problem solved by a convergent simultaneous gradient descent-ascent algorithm.