Please use this identifier to cite or link to this item:
Berkelaar, Arjan B.
Sturm, Jos F.
Zhang, Shuzhong
Year of Publication: 
Series/Report no.: 
Tinbergen Institute Discussion Paper 97-025/4
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming.We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefiniteprogramming, resulting in a new algorithm. Compared to other primal--dual affine scaling algorithms for semidefiniteprogramming (see, De Klerk, Roos and Terlaky), our algorithm enjoys the lowest computationalcomplexity.
Semidefinite Programming
Affine Scaling
Primal-Dual Interior Point Methods
Document Type: 
Working Paper

Files in This Item:
184.86 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.