most citedProximal methods for minimizing the sum of a convex function and a composite function

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

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2012★ 3 cited

Fast Inexact Decomposition Algorithms For Large-Scale Separable Convex Optimization

Quoc Tran Dinh, Ion Necoara, Moritz Diehl

In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual La…

math.OC2011★ 7 cited

Proximal methods for minimizing the sum of a convex function and a composite function

Quoc Tran Dinh, Moritz Diehl

This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex fun…