diff options
| author | Maho Nakata <maho@FreeBSD.org> | 2003-10-04 04:21:13 +0000 |
|---|---|---|
| committer | Maho Nakata <maho@FreeBSD.org> | 2003-10-04 04:21:13 +0000 |
| commit | 6004b8dfd695ad1294f9a8b94bc2a27c23f242e5 (patch) | |
| tree | 89e0b799be4ab858a434e659f8d621024a329561 /math/sdpa/pkg-descr | |
| parent | e3212eb64ee25847bd38ac6c165b2b1ffb62834f (diff) | |
| download | ports-6004b8dfd695ad1294f9a8b94bc2a27c23f242e5.tar.gz ports-6004b8dfd695ad1294f9a8b94bc2a27c23f242e5.zip | |
Add new port math/sdpa.
The SDPA (SemiDefinite Programming Algorithm) is a software package for
solving semidefinite program (SDP). Extremely efficient, almost fastest
around the world!
Notes
Notes:
svn path=/head/; revision=90200
Diffstat (limited to 'math/sdpa/pkg-descr')
| -rw-r--r-- | math/sdpa/pkg-descr | 18 |
1 files changed, 18 insertions, 0 deletions
diff --git a/math/sdpa/pkg-descr b/math/sdpa/pkg-descr new file mode 100644 index 000000000000..7274dcddb415 --- /dev/null +++ b/math/sdpa/pkg-descr @@ -0,0 +1,18 @@ +The SDPA (SemiDefinite Programming Algorithm) is a software package for +solving semidefinite program (SDP). It is based on a Mehrotra-type +predictor-corrector infeasible primal-dual interior-point method. +The SDPA handles the standard form SDP and its dual. It is implemented in C++ +language utilizing the LAPACK for matrix computation. The SDPA incorporates +dynamic memory allocation and deallocation. So, the maximum size of an SDP +to be solved depends on the size of memory which users' computers install. +The SDPA enjoys the following features: + + 1. Callable library of the SDPA is available. + 2. Efficient method for computing the search directions when an SDP + to be solved is large scale and sparse. + 3. Block diagonal matrix structure and sparse matrix structure in + data matrices are available. + 4. Some information on infeasibility of a semidefinite program to be solved + is provided. + +WWW: http://www.is.titech.ac.jp/~yamashi9/sdpa/ |