• Aucun résultat trouvé

Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport

N/A
N/A
Protected

Academic year: 2021

Partager "Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport"

Copied!
10
0
0

Texte intégral

Loading

Figure

Figure 1: The trajectory of γ ℓ given by the SK algorithm is illustrated for decreasing values of ε in
Figure 2: Value of ϕ ω (x). The function is positive above the red line, negative below
Figure 4: Speed ratio of SK algorithm and its accelerated version Algorithm 1 w.r.t parameter ε.

Références

Documents relatifs

Index Terms— optimal control, singular control, second or- der optimality condition, weak optimality, shooting algorithm, Gauss-Newton

Afin d'6viter des appareils speciaux pour transporter des blesses couches dans les automotrices sur rails, nous avons essaye" ici d'utiliser 6galement le m6me systeme que pour

Finally, in the last section we consider a quadratic cost with respect to the control, we study the relation with the gradient plus projection method and we prove that the rate

• the WRMC algorithm through Propositions 2.1 (consistency of the estimation), 2.2 (asymptotic normality), and 2.3 (a first partial answer to the initial question: Does waste

La gure 17.6 repr esente en fonction de l' energie du photon ISR, la proportion d' ev enements pour lesquels ces sous-d eclenchements sont allum es parmi les  ev enements

Theorem 6 For the two player routing game over parallel links, the sequential best-response dynamics con- verges to the unique Nash equilibrium for any initial point x 0 ∈

We will also show that for nonconvex sets A, B the Douglas–Rachford scheme may fail to converge and start to cycle without solving the feasibility problem.. We show that this may

In order to justify the acceleration of convergence that is observed in practice, we now study the local convergence rate of the overrelaxed algorithm, which follows from the