In this paper a new derivative-free method is developed for solving unconstrained nonsmooth optimization problems. This method is based on the notion of a discrete gradient. It is demonstrated that the discrete gradients can be used to approximate subgradients of a broad class of nonsmooth functions. It is also shown that the discrete gradients can be applied to find descent directions of nonsmooth functions. The preliminary results of numerical experiments with unconstrained nonsmooth optimization problems as well as the comparison of the proposed method with nonsmooth optimization solver DNLP from CONOPT-GAMS and derivative-free optimization solver CONDOR are presented.
Citation
To appear in Journal of Opimization and Applications
Article
View Discrete gradient method: a derivative free method for nonsmooth optimization