Abstract
In this chapter, we give some definitions and results connected with convex analysis, convex programming, and Lagrangian duality. In Part Two, these concepts and results are utilized in developing suitable optimality conditions and numerical methods for solving some convex problems.
This is a preview of subscription content, log in via an institution to check access.
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
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stefanov, S.M. (2001). Preliminaries: Convex Analysis and Convex Programming. In: Separable Programming. Applied Optimization, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3417-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3417-1_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4851-9
Online ISBN: 978-1-4757-3417-1
eBook Packages: Springer Book Archive