On a New Smoothing Technique for Non-smooth, Non-convex Optimization
Numerical Algebra Control and Optimization, cilt.10, ss.317-330, 2020 (ESCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 10
- Basım Tarihi: 2020
- Doi Numarası: 10.3934/naco.2020004
- Dergi Adı: Numerical Algebra Control and Optimization
- Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Applied Science & Technology Source, Computer & Applied Sciences, MathSciNet, zbMATH
- Sayfa Sayıları: ss.317-330
- Anahtar Kelimeler: Smoothing techniques, non-smooth analysis, non-Lipschitz problems, global optimization, FILLED FUNCTION-METHOD, GLOBAL DESCENT METHOD, MINIMIZATION, ALGORITHM, SPLINE
- Süleyman Demirel Üniversitesi Adresli: Evet
Özet
In many global optimization techniques, the local search methods are used for different issues such as to obtain a new initial point and to find the local solution rapidly. Most of these local search methods base on the smoothness of the problem. In this study, we propose a new smoothing approach in order to smooth out non-smooth and non-Lipschitz functions playing a very important role in global optimization problems. We illustrate our smoothing approach on well-known test problems in the literature. The numerical results show the efficiency of our method.