Abstract
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.
Download
Yilmaz N. (2025) "A New Approach for Solving Minimax Problems Using New Generation Smoothing Techniques
" Dolomites Research Notes on Approximation, 18(2), 97-111. DOI: 10.25430/pupj-DRNA-2025-2-12
Year of Publication
2025
Journal
Dolomites Research Notes on Approximation
Volume
18
Issue Number
2
Start Page
97
Last Page
111
Date Published
03/2025
ISSN Number
2035-6803
Serial Article Number
12
DOI
10.25430/pupj-DRNA-2025-2-12
Issue
Section
Articles