We present four basic Fortran subroutines for nondifferentiable optimizatio
n with simple bounds and general linear constraints. Subroutine PMIN, inten
ded for minimax optimization, is based on a sequential quadratic programmin
g variable metric algorithm. Subroutines PBUN and PNEW, intended for genera
l nonsmooth problems, are based on bundle-type methods. Subroutine PVAR is
based on special nonsmooth variable metric methods. Besides the description
of methods and codes, we propose computational experiments which demonstra
te the efficiency of this approach.