Preliminaries: Convex Analysis and Convex Programming
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.
KeywordsSaddle Point Convex Function Dual Problem Convex Combination Convex Analysis
Unable to display preview. Download preview PDF.