arXiv (All)
open access
A Logarithmic-dual-update Bregman ADMM for Optimal Transport
This paper studies an entropy Bregman alternating direction method of multipliers (BADMM) with logarithmic dual update for solving discrete optimal transport (OT) problems. The algorithm uses simple row and column normalizations without inner iterations, allowing efficient CPU and GPU implementation
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
- An Alternating Direction Method of Multipliers for Inverse Lithography Problem#152957
- Discrete eigenvalue optimization from entropic smoothing and first-order methods#820645
- Dual-guided Hierarchical Edge Localization for Large-scale Optimal Transport Across Dimensions#1070518
- Improving the matrix multiplication exponent with modern optimization and AlphaEvolve#625429
Record · ID 1217822
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive