Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints.
Thomas MöllenhoffClaudia NieuwenhuisEno TöppeDaniel CremersPublished in: EMMCVPR (2013)
Keyphrases
- convex optimization
- convex optimization problems
- convex programming
- interior point methods
- convex relaxation
- convex constraints
- semi definite programming
- augmented lagrangian method
- linear programming problems
- alternating direction method of multipliers
- primal dual
- interior point
- low rank
- total variation
- optimization problems
- operator splitting
- basis pursuit
- semidefinite program
- computer vision
- quadratic program
- solving problems
- linear programming
- evolutionary algorithm
- image processing