Our final chapter provides a concrete introduction to convex programming, interior point methods, and duality, three of the deepest and most pervasive themes of modern optimization theory. It takes considerable mathematical maturity to appreciate the subtlety of these topics, and it is impossible to do them justice in a short essay. Our philosophy here is to build on previous material on convexity and the MM algorithm. Exposing these connections reinforces old concepts while teaching new ones. The survey article  is especially recommended to readers wanting a more thorough introduction to the topics treated here.
KeywordsSupport Vector Machine Equality Constraint Dual Problem Inequality Constraint Surrogate Function
Unable to display preview. Download preview PDF.