On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution.
Carlos D. Toledo-SuárezManuel Valenzuela-RendónHugo Terashima-MarínEduardo Uresti-CharrePublished in: GECCO (2007)
Keyphrases
- times faster
- learning algorithm
- computational complexity
- optimization algorithm
- computational cost
- computationally efficient
- combinatorial optimization
- synthetic and real datasets
- worst case
- single pass
- space complexity
- computational efficiency
- classification algorithm
- incremental algorithms
- related algorithms
- theoretical analysis
- maximum flow
- constrained optimization
- algorithms require
- significant improvement
- memory requirements
- expectation maximization
- benchmark problems
- data clustering
- preprocessing
- dynamic programming
- k means
- convergence rate
- hybrid algorithm
- cost function
- iterative algorithms
- optimization process
- global convergence
- decomposition algorithm
- image processing algorithms
- empirical analyses
- filtering algorithm
- simulated annealing
- objective function
- optimization procedure
- synthetic datasets
- optimization methods
- binary images
- detection algorithm
- theoretical guarantees
- linear programming
- online algorithms
- optimization criteria
- decision trees
- feature selection