A geometric framework for nonconvex optimization duality using augmented lagrangian functions

Angelia Nedich, Asuman Ozdaglar

Research output: Contribution to journalArticle

19 Scopus citations

Abstract

We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a separation result for nonconvex sets via general concave surfaces. We use this separation result to provide necessary and sufficient conditions for establishing strong duality between geometric primal and dual problems. Using the primal function of a constrained optimization problem, we apply our results both in the analysis of duality schemes constructed using augmented Lagrangian functions, and in establishing necessary and sufficient conditions for the convergence of penalty methods.

Original languageEnglish (US)
Pages (from-to)545-573
Number of pages29
JournalJournal of Global Optimization
Volume40
Issue number4
DOIs
StatePublished - Apr 1 2008
Externally publishedYes

Keywords

  • Augmented Lagrangian functions
  • Duality
  • Penalty

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A geometric framework for nonconvex optimization duality using augmented lagrangian functions'. Together they form a unique fingerprint.

  • Cite this