Inexact Bregman Sparse Newton Method for Efficient Optimal Transport
math.OC
Submitted: 2026-03-07
Updated: 2026-10-31
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- A Sinkhorn-Newton method for entropic optimal transport
- Generalized conditional gradient: analysis of convergence and applications
- PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
- Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise