most citedCombining Lagrangian Decomposition and Excessive Gap Smoothing Technique for Solving Large-Scale Separable Convex Optimization Problems

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2012

Path-Following Gradient-Based Decomposition Algorithms For Separable Convex Optimization

Quoc Tran Dinh, Ion Necoara, Moritz Diehl

A new decomposition optimization algorithm, called \textit{path-following gradient-based decomposition}, is proposed to solve separable convex optimization problems. Unlike path-fo…

math.OC2011★ 1 cited

Combining Lagrangian Decomposition and Excessive Gap Smoothing Technique for Solving Large-Scale Separable Convex Optimization Problems

Tran Dinh Quoc, Carlo Savorgnan, Moritz Diehl

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…