We derive an a-priori parameter range for overrelaxation of the Sinkhorn algorithm, which guarantees global convergence and a strictly faster asymptotic local convergence. Guided by the spectral analysis of the linearized problem we pursue a zero cost procedure to choose a near optimal relaxation parameter.

翻译：我们得出了辛角算法过度宽松的优先参数范围,该算法保证了全球趋同和严格更快的无药可救本地趋同。 在线性问题的光谱分析的指导下,我们采用了零成本程序来选择近乎最佳的放松参数。