A merit function approach to the subgradient method with averaging
Andrzej Ruszczyński · Optimization methods & software · 2007
We consider a version of the subgradient method for convex nonsmooth optimization involving subgradient averaging. Using a merit function approach in the space of decisions and subgradient estimates, we prove convergence of the primal variables to an optimal solution and of the dual variables to an optimal subgradient. Application to dual convex optimization problems is discussed.