A new expected-improvement algorithm for continuous minimax optimization

Abstract : Worst-case design is important whenever robustness to adverse environmental conditions must be ensured regardless of their probability. It leads to minimax optimization, which is most often treated assuming that prior knowledge makes the worst environmental conditions obvious, or that a closed-form expression for the performance index is available. This paper considers the important situation where none of these assumptions is true and where the performance index must be evaluated via costly numerical simulations. Strategies to limit the number of these evaluations are then of paramount importance. One such strategy is proposed here, which further improves the performance of an algorithm recently presented that combines a relaxation procedure for minimax search with the well-known Kriging-based EGO algorithm. Expected Improvement is computed in the minimax optimization context, which allows to further reduce the number of costly evaluations of the performance index. The interest of the approach is demonstrated on test cases and a simple engineering problem from the literature, which facilitates comparison with alternative approaches.
Document type :
Journal articles
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

Contributor : Julien Marzat <>
Submitted on : Monday, August 17, 2015 - 9:42:52 AM
Last modification on : Tuesday, March 26, 2019 - 2:24:42 PM
Long-term archiving on : Wednesday, November 18, 2015 - 10:33:52 AM


2015 - JOGO - A new expected i...
Files produced by the author(s)



Julien Marzat, Eric Walter, Hélène Piet-Lahanier. A new expected-improvement algorithm for continuous minimax optimization. Journal of Global Optimization, Springer Verlag, 2016, 64 (4), pp.785-802. ⟨10.1007/s10898-015-0344-x⟩. ⟨hal-01183567⟩



Record views


Files downloads