On the Convergence of Decomposition Algorithms in Many-Objective Problems.
Ricardo H. C. TakahashiPublished in: EMO (2019)
Keyphrases
- optimization problems
- iterative algorithms
- test problems
- np hard problems
- difficult problems
- benchmark problems
- decomposition methods
- computationally efficient
- learning algorithm
- run times
- decomposition algorithm
- specific problems
- problems in computer vision
- approximate solutions
- orders of magnitude
- related problems
- practical problems
- np complete
- multi objective evolutionary algorithms
- computational geometry
- computational cost
- theoretical justification
- data sets
- convex optimization
- convex optimization problems
- data structure
- stochastic approximation
- convergence analysis
- hard problems
- evolutionary algorithm
- significant improvement
- worst case
- data mining algorithms
- combinatorial optimization