Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata

Research output: Contribution to journalArticle

85 Citations (Scopus)

Abstract

The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and 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 the semidefinite program to be solved is large scale and sparse.

Original languageEnglish
Pages (from-to)235-253
Number of pages19
JournalMathematical Programming, Series B
Volume79
Issue number1-3
DOIs
Publication statusPublished - Oct 1 1997

Fingerprint

Primal-dual Interior Point Method
Semidefinite Program
Semidefinite Programming
Sparsity
Computing

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Cite this

Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. / Fujisawa, Katsuki; Kojima, Masakazu; Nakata, Kazuhide.

In: Mathematical Programming, Series B, Vol. 79, No. 1-3, 01.10.1997, p. 235-253.

Research output: Contribution to journalArticle

@article{0a85c93114b34bc88ef57aab66efb1a7,
title = "Exploiting sparsity in primal-dual interior-point methods for semidefinite programming",
abstract = "The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and 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 the semidefinite program to be solved is large scale and sparse.",
author = "Katsuki Fujisawa and Masakazu Kojima and Kazuhide Nakata",
year = "1997",
month = "10",
day = "1",
doi = "10.1007/BF02614319",
language = "English",
volume = "79",
pages = "235--253",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1-3",

}

TY - JOUR

T1 - Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

AU - Fujisawa, Katsuki

AU - Kojima, Masakazu

AU - Nakata, Kazuhide

PY - 1997/10/1

Y1 - 1997/10/1

N2 - The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and 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 the semidefinite program to be solved is large scale and sparse.

AB - The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and 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 the semidefinite program to be solved is large scale and sparse.

UR - http://www.scopus.com/inward/record.url?scp=0000609227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000609227&partnerID=8YFLogxK

U2 - 10.1007/BF02614319

DO - 10.1007/BF02614319

M3 - Article

AN - SCOPUS:0000609227

VL - 79

SP - 235

EP - 253

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-3

ER -