In resent years, semidefinite program (SDP) has been intensively studies both in theoretical and practical aspects of various fields including interior-point method, combinatorial optimization and the control and systems theory. The SDPA (SemiDefinite Programming Algorithm)  is a C++ implementation of a Mehrotra-type primal-dual predictor-corrector interior-point method for solving the standard form semidefinite program. The SDPA incorporates data structures for handling sparse matrices and an efficient method proposed by Fujisawa et al.  for computing search directions when problems to be solved are large scale and sparse. Finally, we report numerical experiments of the SDP for the structural optimization under multiple eigenvalue constraints.
|Number of pages||8|
|Journal||IPSJ SIG Notes|
|Publication status||Published - Sep 16 1998|