Algorithm 5.

Pseudocode for N-steps of the KL-TV CP algorithm instance.

1:	L ← ‖(A, ∇)‖2; τ ← 1/L; σ ← 1/L; θ ← 1; n ← 0
2:	initialize u0, p0, and q0 to zero values
3:	ū0 ← u0
4:	repeat
5:	$p_{n+1}\leftarrow \frac{1}{2}({\mathbf{1}}_D+p_n+\sigma A{ū}_n-\sqrt{{(p_n+\sigma A{ū}_n-{\mathbf{1}}_D)}^2+4\sigma g})$
6:	qn+1 ← λ(qn + σ∇ūn)/max(λ1I, |qn + σ∇ūn|)
7:	un+1 ← un − τAT pn+1 + τdiv qn+1
8:	ūn+1 ← un+1 + θ(un+1 − un)
9:	n ← n + 1
10:	untiln ≥ N