Preliminaries: Convex Analysis and Convex Programming

  • Stefan M. Stefanov
Part of the Applied Optimization book series (APOP, volume 53)


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.


Saddle Point Convex Function Dual Problem Convex Combination Convex Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Stefan M. Stefanov
    • 1
  1. 1.Department of MathematicsSouth West UniversityBlagoevgradBulgaria

Personalised recommendations