:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Wang, Guillaume
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2604.26265
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
by: Eckstein, Stephan
Published: (2023)

On the convergence rate of the Douglas-Rachford splitting algorithm
by: Abbaszadehpeivasti, Hadi, et al.
Published: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
by: Chizat, Lénaïc
Published: (2024)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

Almost sure convergence rates of stochastic gradient methods under gradient domination
by: Weissmann, Simon, et al.
Published: (2024)

Almost sure convergence of stochastic Hamiltonian descent methods
by: Williamson, Måns, et al.
Published: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

On the sequential convergence of Lloyd's algorithms
by: Portales, Léo, et al.
Published: (2024)

Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems
by: Wang, Shida, et al.
Published: (2024)

Sinkhorn Distributionally Robust Optimization
by: Wang, Jie, et al.
Published: (2021)

Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
by: He, X., et al.
Published: (2023)

Fast solution to the fair ranking problem using the Sinkhorn algorithm
by: Uehara, Yuki, et al.
Published: (2024)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2024)

Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
by: Xu, Zeyi, et al.
Published: (2026)

Symmetric Rank-$k$ Methods
by: Liu, Chengchang, et al.
Published: (2023)

k-Dimensional Agreement in Multiagent Systems
by: Bianchin, Gianluca, et al.
Published: (2022)

Exact worst-case convergence rates for Douglas--Rachford and Davis--Yin splitting methods
by: Nguyen, Edward Duc Hien, et al.
Published: (2025)

Sinkhorn algorithms for entropic vector quantile regression
by: Kato, Kengo, et al.
Published: (2026)

On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates
by: Bruno, Stefano, et al.
Published: (2023)

A scalable sequential adaptive cubic regularization algorithm for optimization with general equality constraints
by: Pei, Yonggang, et al.
Published: (2025)

The Nesterov-Spokoiny Acceleration Achieves Strict $o(1/k^2)$ Convergence
by: Peng, Weibin, et al.
Published: (2023)

Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
by: Gupta, Shuvomoy Das, et al.
Published: (2023)

Qualitative Properties of $k-$Center Problems
by: Long, Vo Si Trong, et al.
Published: (2024)

Adaptive Softassign via Hadamard-Equipped Sinkhorn
by: Shen, Binrui, et al.
Published: (2023)

An inexact inertial projective splitting algorithm with strong convergence
by: Alves, M. Marques, et al.
Published: (2025)

Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach
by: Greco, Giacomo, et al.
Published: (2023)

On the optimal control problem for the k-FORQ/MCH equation with viscosity
by: Wang, Zhao, et al.
Published: (2024)

Primal-dual algorithm for weakly convex functions under sharpness conditions
by: Bednarczuk, Ewa, et al.
Published: (2024)

Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
by: Chizat, Lénaïc, et al.
Published: (2024)

Accelerating operator Sinkhorn iteration with overrelaxation
by: Soma, Tasuku, et al.
Published: (2024)

On Sinkhorn's Algorithm and Choice Modeling
by: Qu, Zhaonan, et al.
Published: (2023)

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
by: Mohammadi, Hesameddin, et al.
Published: (2022)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
by: Simon, Emile, et al.
Published: (2011)

Uniform exponential convergence of SAA with AMIS and asymptotics of its optimal value
by: Zhang, Wenjin, et al.
Published: (2024)

On the Global Optimality of Linear Policies for Sinkhorn Distributionally Robust Linear Quadratic Control
by: Cescon, Riccardo, et al.
Published: (2025)

On the geometry of sharp minima
by: Corella, Alberto Domínguez
Published: (2026)

Sinkhorn Distributionally Robust State Estimation via System Level Synthesis
by: Feng, Yulin, et al.
Published: (2026)

A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem
by: Haller, Stefan, et al.
Published: (2024)

Practical prescribed-time prescribed performance control with asymptotic convergence -- A vanishing sigma-modification approach
by: Golestani, Mehdi, et al.
Published: (2026)