A non-Euclidean dual gradient ascent for entropically regularized SDPs is shown to converge with dimension-independent rates, achieving Sinkhorn-like complexity for optimal transport and optimal-scaling results for permutation synchronization SDPs.
Fast entropy-regularized SDP relaxations for permutation synchronization.In preparation, 2025
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
-
Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming
A non-Euclidean dual gradient ascent for entropically regularized SDPs is shown to converge with dimension-independent rates, achieving Sinkhorn-like complexity for optimal transport and optimal-scaling results for permutation synchronization SDPs.