EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2298. On the complexity of optimizing black-box functions in oracle models
Invited abstract in session TD-52: Integer Programming and Combinatorial Optimization: Complexity Questions and Algorithms, stream Combinatorial Optimization.
Tuesday, 14:30-16:00Room: 8003 (building: 202)
Authors (first author is the speaker)
| 1. | Sergei Chubanov
|
| Bosch Center For Artificial Intelligence |
Abstract
We discuss algorithmic complexity of general discrete nonlinear optimization models with augmentation, verification, and evaluation oracles. We show that in many situations where at least a verification oracle is available, which verifies whether a given solution is optimal, an optimal solution for the respective discrete optimization problem can be found in strongly polynomial oracle time. Also, we discuss algorithms based on machine-learning methods with performance guarantees for practical black-box optimization scenarios of large-scale scheduling problems and optimization problems with partial differential equations where only evaluation oracles are available.
Keywords
- Combinatorial Optimization
- Global Optimization
- Mathematical Programming
Status: accepted
Back to the list of papers