An approximation algorithm for convex multiplicative programming problems.
Lizhen ShaoMatthias EhrgottPublished in: MCDM (2011)
Keyphrases
- benchmark problems
- learning algorithm
- k means
- dynamic programming
- computational cost
- globally optimal
- computational complexity
- worst case
- matching algorithm
- detection algorithm
- polygonal approximation
- iterative algorithms
- convex relaxation
- neural network
- preprocessing
- convex hull
- convergence rate
- np complete
- computational geometry
- piecewise constant
- stationary points
- closed form
- simulated annealing
- programming language
- cost function
- objective function
- genetic algorithm