Abstract
This article summarizes the basic ideas of convex optimization in finite-dimensional vector spaces. Duality, the Fenchel transforms and the subdifferential are introduced and used to discuss Lagrangean duality and the Kuhn–Tucker theorem. Applications of these ideas can be found in duality.
This chapter was originally published in The New Palgrave Dictionary of Economics, 2nd edition, 2008. Edited by Steven N. Durlauf and Lawrence E. Blume
Similar content being viewed by others
Bibliography
Arrow, K., L. Hurwicz, and H. Uzawa. 1961. Constraint qualifications in maximization problems. Naval Logistics Research Quarterly 8: 175–191.
Mas-Colell, A., and W. Zame. 1991. Equilibrium theory in infinite dimensional spaces. In Handbook of mathematical economics, ed. W. Hildenbrand and H. Sonnenschein, vol. 4. Amsterdam: North-Holland.
Rockafellar, R.T. 1970. Convex analysis. Princeton: Princeton University Press.
Rockafellar, R.T. 1974. Conjugate duality and opttimization, CBMS Regional Conference Series No. 16. Philadelphia: SIAM.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 2008 The Author(s)
About this entry
Cite this entry
Blume, L.E. (2008). Convex Programming. In: The New Palgrave Dictionary of Economics. Palgrave Macmillan, London. https://doi.org/10.1057/978-1-349-95121-5_591-2
Download citation
DOI: https://doi.org/10.1057/978-1-349-95121-5_591-2
Received:
Accepted:
Published:
Publisher Name: Palgrave Macmillan, London
Online ISBN: 978-1-349-95121-5
eBook Packages: Springer Reference Economics and FinanceReference Module Humanities and Social SciencesReference Module Business, Economics and Social Sciences
Publish with us
Chapter history
-
Latest
Convex Programming- Published:
- 22 April 2017
DOI: https://doi.org/10.1057/978-1-349-95121-5_591-2
-
Original
Convex Programming- Published:
- 18 November 2016
DOI: https://doi.org/10.1057/978-1-349-95121-5_591-1