|
|||||
|
|
Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization |
|
| Authors: | A. M. Bagirov B. Karasözen M. Sezer |
| Affiliation: | (1) Centre for Informatics and Applied Optimization, School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, 3353, Australia;(2) Department of Mathematics & Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey;(3) Department of Mathematics, Middle East Technical University, Ankara, Turkey |
| Abstract: | 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 the nonsmooth optimization solver DNLP from CONOPT-GAMS and the derivative-free optimization solver CONDOR are presented. |
| Keywords: | Nonsmooth optimization Derivative-free optimization Subdifferentials Discrete gradients |
| 本文献已被 SpringerLink 等数据库收录！ | |