Direct search versus simulated annealing on two high dimensional problems.
David R. EasterlingLayne T. WatsonMichael L. MadiganPublished in: SpringSim (HPC) (2011)
Keyphrases
- high dimensional problems
- direct search
- simulated annealing
- hill climbing
- genetic algorithm
- high dimensional
- dimension reduction
- evolutionary algorithm
- metaheuristic
- tabu search
- differential evolution
- genetic algorithm ga
- search procedure
- combinatorial optimization
- search space
- global optimum
- solution space
- optimization methods
- optimization method
- search strategy
- exhaustive search
- multi objective
- preprocessing
- neural network
- low dimensional
- optimization problems
- pairwise
- least squares
- search algorithm
- feature extraction
- machine learning