<b>Duality for semidefinite programming; Entropy optimization: Interior point methods; Homogeneous selfdual methods for linear programming; Linear programming: Interior point methods; Linear programming: Karmarkar projective algorithm; Matrix completion problems; Potential reduction methods for linear programming; Semi-infinite programming, semidefinite programming and perfect duality; Semidefinite programming and determinant maximization; Semidefinite programming and structural optimization; Semidefinite programming: Optimality conditions and stability; Sequential quadratic programming: Interior point methods for distributed optimal control problems; Solving large scale and sparse semidefinite programs; Successive quadratic programming: Solution by active sets and interior point methods</b> INTERIOR POINT METHODS FOR SEMIDEFINITE PROGRAMMING