Subgradient methods in network resource allocation: Rate analysis

Angelia Nedić, Asuman Ozdaglar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Scopus citations

Abstract

We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance guarantees and providing convergence rate analysis. We propose and analyze methods that use averaging schemes to generate approximate primal optimal solutions. We provide estimates on the convergence rate of the generated primal solutions in terms of both the amount of feasibility violation and bounds on the primal function values. The feasibility violation and primal value estimates are given per iteration, thus providing practical stopping criteria. We provide a numerical example that illustrate the performance of the subgradient methods with averaging in a network resource allocation problem.

Original languageEnglish (US)
Title of host publicationCISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages1189-1194
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
EventCISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States
Duration: Mar 19 2008Mar 21 2008

Publication series

NameCISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Other

OtherCISS 2008, 42nd Annual Conference on Information Sciences and Systems
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/19/083/21/08

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Subgradient methods in network resource allocation: Rate analysis'. Together they form a unique fingerprint.

Cite this