aboutsummaryrefslogtreecommitdiff
path: root/math/sdpa-gmp
Commit message (Collapse)AuthorAgeFilesLines
* Update to 20090928 version.Maho Nakata2009-09-282-5/+5
| | | | | | | Feature safe: yes Notes: svn path=/head/; revision=242198
* Chase libgmp and bump PORTREVISION.Alex Dupre2009-05-131-1/+2
| | | | Notes: svn path=/head/; revision=233833
* Update to 7.1.2 20090321 ver.Maho Nakata2009-04-082-4/+4
| | | | Notes: svn path=/head/; revision=231849
* Update to 7.1.2 20090204 version.Maho Nakata2009-02-172-7/+7
| | | | Notes: svn path=/head/; revision=228534
* Chase mpfr library.Alex Dupre2009-01-301-1/+2
| | | | Notes: svn path=/head/; revision=227228
* Update to 7.1.1 20080618 version.Maho Nakata2008-06-202-9/+9
| | | | Notes: svn path=/head/; revision=215423
* The SDPA-GMP (The GMP version of SemiDefinite Programming Algorithm)Maho Nakata2008-04-114-0/+65
is a software package for solving semidefinite program (SDP), intended for very hard to solve SDPs and SDPs requires ultra high accuracy. It is based on a Mehrotra-type predictor-corrector infeasible primal-dual interior-point method. The SDPA-GMP shares the same features as the SDPA, excpt for calculations will be done with multiple precision arithmetics via the GMP (the GNU Multiple Precision Arithmetic Library). WWW: http://sdpa.indsys.chuo-u.ac.jp/sdpa/index.html Notes: svn path=/head/; revision=211030
generated by cgit v1.2.3 (git 2.25.1) at 2025-03-04 00:20:58 +0000