New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm.
Remigijus PaulaviciusClaire S. AdjimanPublished in: J. Glob. Optim. (2020)
Keyphrases
- learning algorithm
- theoretical analysis
- high accuracy
- preprocessing
- np hard
- experimental evaluation
- recognition algorithm
- objective function
- optimization algorithm
- computational complexity
- k means
- significant improvement
- cost function
- times faster
- single pass
- estimation algorithm
- feature selection
- least squares
- probabilistic model
- computational cost
- computationally efficient
- linear programming
- clustering method
- path planning
- simulated annealing
- convergence rate
- search strategy
- improved algorithm