An objective space cut and bound algorithm for convex multiplicative programmes.
Lizhen ShaoMatthias EhrgottPublished in: J. Glob. Optim. (2014)
Keyphrases
- worst case
- learning algorithm
- optimal solution
- preprocessing
- high accuracy
- objective function
- higher dimensional
- computational cost
- np hard
- search space
- computational complexity
- experimental evaluation
- significant improvement
- linear programming
- theoretical analysis
- optimization algorithm
- convex hull
- globally optimal
- expectation maximization
- segmentation algorithm
- clustering method
- space requirements