Branch-and-reduce algorithm for convex programs with additional multiplicative constraints.
Harold P. BensonErjiang SunPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- learning algorithm
- preprocessing
- optimal solution
- cost function
- convex programs
- segmentation algorithm
- expectation maximization
- linear programming
- np hard
- k means
- dynamic programming
- particle swarm optimization
- detection algorithm
- evolutionary algorithm
- computational cost
- worst case
- simulated annealing
- reinforcement learning
- training data
- computer vision
- convergence rate
- piecewise linear
- multiple constraints
- machine learning