Abstract
It is well known that the convex separation principle plays a fundamental role in many aspects of nonlinear analysis, optimization, and their applications. Actually the whole convex analysis revolves around using separation theorems for convex sets. In problems with nonconvex data separation theorems are applied to convex approximations. This is a conventional way to derive necessary optimality conditions in constrained optimization: first build tangential convex approximations of the problem data around an optimal solution in primal spaces and then apply convex separation theorems to get supporting elements in dual spaces (Lagrange multipliers, adjoint arcs, prices, etc.). For problems of nonsmooth optimization this approach inevitably leads to the usage of convex sets of normals and subgradients, whose calculus is also based on convex separation theorems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mordukhovich, B.S. (2006). Extremal Principle in Variational Analysis. In: Variational Analysis and Generalized Differentiation I. Grundlehren der mathematischen Wissenschaften, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31247-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-31247-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25437-9
Online ISBN: 978-3-540-31247-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)