CSDP CSDP is a library of routines that implements a predictor corrector variant of the semidefinite programming algorithm of Helmberg, Rendl, Vanderbei, and Wolkowicz. The main advantages of this code are that it is written to be used as a callable subroutine, it is written in C and Fortran for efficiency, it makes effective use of sparsity in the constraint matrices, and that it includes support for linear inequality constraints in addition to linear equality constraints.

Current Version:   2.0 License Type:   Free

Home Site: http://www.nmt.edu/~borchers/csdp.html Source Code Availability: Yes Available Binary Packages: Debian Package: No RedHat RPM Package: No Other Packages: No Targeted Platforms: Tested (Makefiles supplied) on Linux, SunOS 4.x, Solaris 2.5.1, and AIX 4.2. Software/Hardware Requirements: C compiler, and also a Fortran Compiler is needed for version 1.0.

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization