[Coin-announce] New COIN-OR Project: CSDP

[Brian Borchers]

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 for
efficiency, and it makes effective use of sparsity in the constraint
matrices.

CSDP has now become a COIN-OR project.
 
  - There is a new mailing list for discussion of CSDP.  See
 
      http://list.coin-or.org/mailman/listinfo/csdp
 
    to join the list or browse messages that have been posted to the list.
 
  - There is a second mailing list for bug tracking.  See
 
      http://list.coin-or.org/mailman/listinfo/csdp-tickets

  - The web site for development of future versions of CSDP is at
 
      http://projects.coin-or.org/Csdp/
 
    At the development web site you can browse and download the latest 
    source code, file and track bug reports, and view the archives of the 
    mailing lists.  
 
    In recent weeks CSDP has been updated with support for an Octave 2.9x
    interface, an improved Makefile, and updated documentation.  A new
    stable version of CSDP should be released in the fall of 2006.  

  - The most recent stable version of CSDP is CSDP 5.0.  This version is
    still available from 
 
      http://www.nmt.edu/~borchers/csdp.html