arXiv:2004.09330 [math.FA]AbstractReferencesReviewsResources
Convex Analysis and Duality
Published 2020-04-20Version 1
Convexity is an important notion in non linear optimization theory as well as in infinite dimensional functional analysis. As will be seen below, very simple and powerful tools will be derived from elementary duality arguments (which are byproducts of the Moreau-Fenchel transform and Hahn Banach Theorem). We will emphasize on applications to a large range of variational problems. Some arguments of measure theory will be skipped.
Journal: Encyclopedia of Mathematical physics, Academic Press (2006), pp.642-652
Keywords: convex analysis, infinite dimensional functional analysis, non linear optimization theory, hahn banach theorem, elementary duality arguments
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1708.06548 [math.FA] (Published 2017-08-22)
More on the Concept of Duality in Convex Analysis, the Characterizations of Fenchel Transform and Identity
arXiv:2411.04212 [math.FA] (Published 2024-11-06)
General monotonicity
arXiv:math/0412551 [math.FA] (Published 2004-12-31)
The Kreps-Yan theorem for $L^\infty$