The success of interior point algorithms for large-scale linear programming has prompted researchers to extend these algorithms to the semidefinite programming case. In this paper, the so-called method of approximate centers is extended to semidefinite programming.
Report 96-27, Faculty of Technical Mathematics and Informatics, Delft University of Technology, 1996
Contact: [email protected]