| Article ID: | iaor19981961 |
| Country: | China |
| Volume: | 10 |
| Issue: | 2 |
| Start Page Number: | 168 |
| End Page Number: | 175 |
| Publication Date: | Apr 1997 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Jiang J.M., Shi M.G. |
In this paper, by analyzing the properties of the central path, the authors give a logarithmic barrier Newton algorithm for semidefinite programming. It can be seen as an extension of the method for LP problems developed by Roos and Vial. Also, the algorithm possesses polynomial convergence.