1997•Mathematical ProgrammingRequires access

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

Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata

Open publisher page 143 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 143 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Interior point method, Semidefinite programming, Mathematics, Semidefinite embedding, Dual (grammatical number), Mathematical optimization, Linear programming, Point (geometry)