An extension of algcon1 for the distributed optimization problem original is proposed in [1]} by directly adding a gradient step in the update of \(X^{k+1}\) .
The resulting algorithm is a quantized version of DGD and can only converge sublinearly.
