

Unconstrained minimizer

domin.tar contains Spellucci's implementation
of the BFGS minimizer, with control of conditioning, updating of the
Cholesky decomposition and a stepsize code based on a mix of interpolation
and backtracking. It also has the possibility to use numerical gradients.
domin_ad.tar is the same code, combined with netlib's jakef
code for automatic differentiation which takes off the burden of coding the
analytic gradient.

domin_c.tar contains a f2c'ed version of domin.f
you will need also f2clibs.tar for using this.
Bound constrained minimization
 gpcg.tar
is the implementation of the MoreToraldo version of the conjugate gradient
method combined with gradient projection. There is presently no
preconditioner built in.
 gpcg_c.tar
is the same code in its version from f2c (uses f2clibs)

pl2_orig.tar.gz is a f77/gfortran implementation
of Heinrich's ''3directionsmethod'' combined with an incomplete
Newton's method based on the Lanczos method and with gradient projection.
This is meant for large scale possibly nonconvex bound constrained minimization
and aims in finding second order necessary points.

pl2c2.tar.gz is this the pl2 code in ansi c,
accompanied by the necessary stuff from clapack. no f2c stuff needed here.
convex QP solver

dualqp.tar contains Spellucci's implementation
of the GoldfarbIdnani dual QP method for solving general convex QP's.
comes with driver which allows sparse matrix input. internally there
is no sparse linear algebra. The original algorithm using unitary
tansformations is used, which would destroy sparsitiy anyway.

dualqp_c.tar is the same code translated with f2c
hence you will need f2clibs for this.
