Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer New York
About this chapter
Cite this chapter
Güler, O. (2010). Duality Theory and Convex Programming. In: Foundations of Optimization. Graduate Texts in Mathematics, vol 258. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68407-9_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-68407-9_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-34431-7
Online ISBN: 978-0-387-68407-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)