Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Discrete gradient method: Derivative-free method for nonsmooth optimization
Download
index.pdf
Date
2008-05-01
Author
Bagirov, A. M.
Karasözen, Bülent
Sezer, M.
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
8
views
19
downloads
Cite This
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.
Subject Keywords
Nonsmooth optimization
,
Derivative-free optimization
,
Subdifferential
,
Discrete gradients
URI
https://hdl.handle.net/11511/32669
Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
DOI
https://doi.org/10.1007/s10957-007-9335-5
Collections
Graduate School of Applied Mathematics, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. M. Bagirov, B. Karasözen, and M. Sezer, “Discrete gradient method: Derivative-free method for nonsmooth optimization,”
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
, vol. 137, no. 2, pp. 317–334, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32669.