1. Auslender, A. (1985) Two general methods for computing saddle points with applications for decomposing convex programming problems. Appl. Math. Optim. 13, 79–95
2. Bertsekas, D. P. (1979) Convexification procedures and decomposition methods for nonconvex optimization problems. JOTA 29, 169–197
3. Cohen, G., Zhu, D. L. (1984) Decomposition coordination methods in largescale optimization problems. The nondifferentiable case and the use of augmented lagrangian. In: Cruz J. (Ed.) Advances in large scale systems theory and applications, vol. I, JAI Press, Greenwitch, Connecticut, 203–266
4. Eckstein, J. (1994) Parallel alternating direction multiplier decomposition of convex programs. JOTA 80, 39–61
5. Hamdi, A. (1997) Methode de Lagrangiens augmentés en programmation convexe et non convexe et applications à la décomposition. PhD Thesis, Blaise Pascal University, Clermont-Ferrand, France