Title
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
Abstract
The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and the Nesterov-Todd search directions have been used in many primal-dual interior-point methods for semidefinite programs. This paper proposes an efficient method for computing the two directions when a semidefinite program to be solved is large scale and sparse.
Year
DOI
Venue
1997
10.1007/BF02614319
Math. Program.
Keywords
DocType
Volume
primal-dual interior-point method,interior-point methods,exploiting sparsity,semidefinite programming,sparsity,interior point methods,interior point method
Journal
79
Issue
ISSN
Citations 
1-3
0025-5610
55
PageRank 
References 
Authors
7.45
7
3
Name
Order
Citations
PageRank
Katsuki Fujisawa124828.63
Masakazu Kojima21603222.51
Kazuhide Nakata321624.12