Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 15, Issue 2, Pages 193-205Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1008739111712
Keywords
nonsmooth; nondifferential optimization; nonlinear programming
Ask authors/readers for more resources
Here we introduce a new implementation of well-known Shor's r-algorithm with 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. Springer Series in Computational Mathematics, vol. 3). The modifications made to Shor's algorithm are heuristic. They mostly concern the termination criteria and the line search strategy. A large number of test runs indicate that this implementation is very robust, efficient and accurate. We hope that this implementation of Shor's r-algorithm will prove to be useful for solving a wide class of non-smooth optimization problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available