A modified simplicial algorithm for convex maximization based on an extension of ω-subdivision.
Takahito KunoPublished in: J. Glob. Optim. (2018)
Keyphrases
- times faster
- significant improvement
- cost function
- objective function
- convex hull
- dynamic programming
- learning algorithm
- globally optimal
- improved algorithm
- detection algorithm
- experimental evaluation
- computational cost
- data sets
- reinforcement learning
- ant colony optimization
- input data
- probabilistic model
- theoretical analysis
- optimization algorithm
- np hard
- clustering method
- classification algorithm
- matching algorithm
- k means
- computational complexity
- convergence rate
- high accuracy