Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems.
Rickard KarlssonLaurens BliekSicco VerwerMathijs de WeerdtPublished in: BNAIC/BENELEARN (Selected Papers) (2020)
Keyphrases
- optimization problems
- continuous domains
- discrete optimization
- continuous optimization
- practical problems
- test problems
- combinatorial optimization
- optimization approaches
- learning algorithm
- convex optimization problems
- benchmark problems
- optimization methods
- computationally expensive
- related problems
- significant improvement
- data structure
- computationally efficient
- combinatorial optimization problems
- computational cost
- run times
- continuous variables
- global optimization problems
- optimization criteria
- approximate solutions
- evolution strategy
- theoretical guarantees
- exact algorithms
- convergence rate
- global optimization
- continuous state spaces
- metaheuristic
- worst case
- np hard optimization problems