Technical Note - A General Inner Approximation Algorithm for Nonconvex Mathematical Programs.
Barry R. MarksGordon P. WrightPublished in: Oper. Res. (1978)
Keyphrases
- segmentation algorithm
- provably correct
- computational complexity
- approximation ratio
- improved algorithm
- k means
- cost function
- detection algorithm
- optimization algorithm
- learning algorithm
- significant improvement
- experimental evaluation
- expectation maximization
- objective function
- times faster
- particle swarm optimization
- optimal solution
- worst case
- computational cost
- dynamic programming
- high accuracy
- special case
- tree structure
- randomized algorithm
- preprocessing
- polygonal approximation
- search space
- closed form
- matching algorithm
- np hard
- probabilistic model
- maximum likelihood
- linear programming
- simulated annealing