An algorithm for computing solutions of variational problems with global convexity constraints.
Ivar EkelandSantiago Moreno-BrombergPublished in: Numerische Mathematik (2010)
Keyphrases
- benchmark problems
- optimal solution
- approximate solutions
- optimal or near optimal
- cost function
- dynamic programming
- solution quality
- greedy algorithms
- detection algorithm
- test problems
- partial solutions
- segmentation algorithm
- search space
- exact algorithms
- iterative algorithms
- global consistency
- combinatorial problems
- constrained problems
- exact solution
- geometric constraints
- constrained optimization
- learning algorithm
- knapsack problem
- optimization problems
- k means
- computational complexity
- solution space
- heuristic methods
- combinatorial optimization
- constraint satisfaction
- expectation maximization
- np hard
- optimization criteria
- distributed constraint optimization problems
- combinatorial optimisation
- np hard optimization problems