DOE OSTI · 1631967
Derivative-free robust optimization by outer approximations
Abstract
We develop an algorithm for minimax problems that arise in robust optimization in the absence of objective function derivatives. The algorithm utilizes an extension of methods for inexact outer approximation in sampling a potentially infinite-cardinality uncertainty set. Clarke stationarity of the algorithm output is established alongside desirable features of the model-based trust-region subproblems encountered. We demonstrate the practical benefits of the algorithm on a new class of test problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Menickelly, Matt, Wild, Stefan M.. 2018-10-26. Derivative-free robust optimization by outer approximations. https://doi.org/10.1007/s10107-018-1326-9. https://engineeringpapers.com/record/osti%3A1631967/derivative-free-robust-optimization-by-outer-approximations
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.