A New Approach for Solving Minimax Problems Using New Generation Smoothing Techniques
Dolomites Research Notes on Approximation, cilt.18, sa.2, ss.97-111, 2025 (ESCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 18 Sayı: 2
- Basım Tarihi: 2025
- Doi Numarası: 10.25430/pupj-drna-2025-2-12
- Dergi Adı: Dolomites Research Notes on Approximation
- Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, zbMATH, Directory of Open Access Journals
- Sayfa Sayıları: ss.97-111
- Anahtar Kelimeler: Minimax problems, non-smooth optimization, smoothing
- Süleyman Demirel Üniversitesi Adresli: Evet
Özet
This study focuses on solving finite minimax problems. A new reformulation for the minimax problems is established based on indicator functions. The relations between the original and reformulated problems are investigated. Based on the new formulation of minimax problems, a new smoothing approach is proposed via the approximation of the indicator functions. A new algorithm is developed to solve the reformulated and smoothed problems. Finally, the performance of the algorithm is illustrated on some test problems, and the comparison of the obtained numerical results with the other methods is presented.