An implementation of Shor's r-algorithm

Here we introduce a new implementation of well-known Shor's r-algorithm wit h space dilations along the difference of two successive (sub)gradients for minimization of a nonlinear (non-smooth) function (N.Z. Shor, Minimization methods for Non-Differentiable Functions, Springer-Verlag: Berlin, 1985. S pringer Series in Computational Mathematics, vol. 3). The modifications mad e to Shor's algorithm are heuristic. They mostly concern the termination cr iteria and the line search strategy. A large number of test runs indicate t hat this implementation is very robust, efficient and accurate. We hope tha t this implementation of Shor's r-algorithm will prove to be useful for sol ving a wide class of non-smooth optimization problems.