Performance bounds for the k-batch greedy strategy in optimization problems with curvature.
Yajing LiuZhenliang ZhangEdwin K. P. ChongAli PezeshkiPublished in: ACC (2016)
Keyphrases
- greedy strategy
- optimization problems
- greedy algorithm
- evolutionary algorithm
- objective function
- lower bound
- worst case
- upper bound
- metaheuristic
- optimization methods
- error bounds
- multiscale
- upper and lower bounds
- cost function
- online algorithms
- lower and upper bounds
- multi objective
- traveling salesman problem
- image processing
- circular arcs
- average case
- combinatorial optimization
- geometrical properties
- batch learning
- space curves
- genetic algorithm
- worst case bounds
- tight bounds
- batch mode
- online learning
- scale space
- dynamic programming
- special case
- computer vision