Dinh, Quoc Tran; Savorgnan, Carlo; Diehl, Moritz - In: Computational Optimization and Applications 55 (2013) 1, pp. 75-111
A new algorithm for solving large-scale convex optimization problems with a separable objective function is proposed. The basic idea is to combine three techniques: Lagrangian dual decomposition, excessive gap and smoothing. The main advantage of this algorithm is that it automatically and...
