In our earlier section on theorems of the alternative (Section 2.2), we observed that finitely generated cones are closed. Remarkably, a finite linear-algebraic assumption leads to a topological conclusion. In this section we pursue the consequences of this type of assumption in convex analysis.
KeywordsDual Problem Duality Theorem Semidefinite Program Closed Convex Cone Polyhedral Cone
Unable to display preview. Download preview PDF.