Table of Contents -- Primal-Dual Interior-Point Methods

Table of Contents

Chapter 1: Introduction

Chapter 2: Background: Linear Programming and Interior-Point Methods Chapter 3: Complexity Theory Chapter 4: Potential-Reduction Methods Chapter 5: Path-Following Algorithms Chapter 6: Infeasible-Interior-Point Algorithms Chapter 7: Superlinear Convergence and Finite Termination Chapter 8: Extensions Chapter 9: Detecting Infeasibility Chapter 10: Practical Aspects of Primal-Dual Algorithms Chapter 11: Implementations Appendix A: Basic Concepts and Results Appendix B: Software Packages Bibliography
Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+