arXiv (All)
open access
On the Linear Convergence of SISTA for Entropic Martingale Optimal Transport
We prove a linear convergence rate of a Sinkhorn-type algorithm for entropic martingale optimal transport in arbitrary dimension. The algorithm follows a block-coordinate ascent scheme, alternating exact Sinkhorn updates for the marginal potentials with an explicit gradient step for the potential as
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
- A Gauge-Fixed Sinkhorn Algorithm for Semi-Relaxed Optimal Transport#246916
- Optimal Transport and Ricci Flow / Marco Flaim ; Gutachter: Alexander Lytchak ; Betreuer: Karl-Theodor Sturm#1154206
- Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis#153063
- Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral Sandwich#451314
- Kurdyka-Łojasiewicz-based convergence analysis with approximate weakly convex subdifferentials: bundle, quadratic penalty, and moving balls approximation methods#1401439
Record · ID 1401669
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