Interior-Point Methods for Convex and Semidefinite Programming

内点法已被证明是求解大型、稀疏线性和二次规划问题的有效方法。这些方法正在被扩展，以涵盖更一般的问题类别。特别是，内点技术正被用于创建求解凸规划问题和半定规划问题的有效算法。第一类对于一般的非线性优化很重要，第二类对于整数规划有重要的应用。

Interior-point methods have proven to be efficient for solution of large, sparse linear and quadratic programming problems. These methods are being extended to cover more general classes of problems. In particular, interior-point technology are being used to create efficient algorithms for the solution of convex programming problems and semidefinite programming problems. The first class is important for general nonlinear optimization and the second has important applications to integer programming.