Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods


In this paper, we study methods for generating approximate primal solutions as a by-product of subgradient methods applied to the Lagrangian dual of a primal convex (possibly nondifferentiable) constrained optimization problem. Our work is motivated by constrained primal problems with a favorable dual problem structure that leads to efficient implementation… (More)
DOI: 10.1137/070708111


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

225 Citations

Semantic Scholar estimates that this publication has 225 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics