An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques.
Rasmus BokrantzAnders ForsgrenPublished in: INFORMS J. Comput. (2013)
Keyphrases
- optimization algorithm
- objective function
- times faster
- cost function
- recognition algorithm
- computational complexity
- detection algorithm
- experimental evaluation
- three dimensional
- matching algorithm
- segmentation algorithm
- expectation maximization
- high accuracy
- computational cost
- significant improvement
- k means
- evolutionary algorithm
- image segmentation
- dynamic programming
- search space
- search algorithm
- optimal solution
- convex optimization
- globally optimal
- parametric curves
- convex constraints
- gradient projection