Skip to main content

Convex Analysis

  • Chapter
  • 179k Accesses

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 196))

Abstract

This book is mostly about linear programming. However, this subject, important as it is, is just a subset of a larger subject called convex analysis. In this chapter, we shall give a brief introduction to this broader subject. In particular, we shall prove a few of the fundamental results of convex analysis and see that their proofs depend on some of the theory of linear programming that we have already developed.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Until now we’ve used subscripts for the components of a vector. In this chapter, subscripts will be used to list sequences of vectors. Hopefully, this will cause no confusion.

  2. 2.

    Given any vector ξ, we use the notation ξ > 0 to indicate that every component of ξ is strictly positive: ξ j  > 0 for all j.

Bibliography

  • Carathéodory, C. (1907). Über den variabilitätsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen. Mathematische Annalen, 64, 95–115.

    Article  Google Scholar 

  • Farkas, J. (1902). Theorie der einfachen Ungleichungen. Journal für die reine und angewandte Mathematik, 124, 1–27.

    Google Scholar 

  • Gordan, P. (1873). Über die Auflösung linearer Gleichungen mit reelen coefficienten. Mathematische Annalen, 6, 23–28.

    Article  Google Scholar 

  • Rockafellar, R. (1970). Convex analysis. Princeton: Princeton University Press.

    Book  Google Scholar 

  • Stiemke, E. (1915). Über positive Lösungen homogener linearer Gleichungen. Mathematische Annalen, 76, 340–342.

    Article  Google Scholar 

  • Tucker, A. (1956). Dual systems of homogeneous linear equations. Annals of Mathematics Studies, 38, 3–18.

    Google Scholar 

  • Ville, J. (1938). Sur la théorie général des jeux ou intervient l’habileté des jouers. In E. Borel (Ed.), Traité du Calcul des probabilités et des ses applications. Paris: Gauthiers-Villars.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Vanderbei, R.J. (2014). Convex Analysis. In: Linear Programming. International Series in Operations Research & Management Science, vol 196. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-7630-6_10

Download citation

Publish with us

Policies and ethics