Duality Theory and Convex Programming

Part of the Graduate Texts in Mathematics book series (GTM, volume 258)


The theory of duality is an important tool in optimization, both in theory and in computation. Although duality is not universally applicable in optimization, it holds under mild regularity assumptions in some important classes of problems such as convex programs and some of its close relatives.


Saddle Point Dual Problem Duality Theory Lagrangian Function Convex Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer New York 2010

Authors and Affiliations

  1. 1.Department of Mathematics & StatisticsUniversity of MarylandBaltimoreUSA

Personalised recommendations