For γ = 1 with agreement constraints, our algorithm specializes to an earlier proposed technique by (Ganchev et al., 2008).
our algorithm puts these dual decomposition techniques with Algorithm 3 Projected Subgradient-based Lagrange Relaxation Algorithm that optimizes Eq.