Derivative-free robust optimization by outer approximations
Journal Article
·
· Mathematical Programming
- Argonne National Lab. (ANL), Argonne, IL (United States). Mathematics and Computer Science Division
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.
- Research Organization:
- Argonne National Laboratory (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- Grant/Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1631967
- Journal Information:
- Mathematical Programming, Journal Name: Mathematical Programming Journal Issue: 1-2 Vol. 179; ISSN 0025-5610
- Publisher:
- SpringerCopyright Statement
- Country of Publication:
- United States
- Language:
- English
A survey of robust optimization based machine learning with special reference to support vector machines
|
journal | December 2019 |
Similar Records
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
Sequential linear integer programming for integer optimal control with total variation regularization
Journal Article
·
2022
· Mathematical Programming
·
OSTI ID:2311742
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
Journal Article
·
2021
· SIAM Journal on Optimization
·
OSTI ID:1839939
Sequential linear integer programming for integer optimal control with total variation regularization
Journal Article
·
2022
· ESAIM: Control, Optimisation and Calculus of Variations
·
OSTI ID:1894392