Duality for almost convex optimization problems via the perturbation approach.
Radu Ioan BotGábor KassayGert WankaPublished in: J. Glob. Optim. (2008)
Keyphrases
- convex optimization problems
- convex optimization
- primal dual
- linear programming
- dual formulation
- optimization problems
- interior point methods
- learning problems
- structured sparsity
- total variation
- low rank
- linear program
- data mining
- learning experience
- machine learning algorithms
- markov random field
- quadratic programming
- object recognition
- computer vision
- genetic algorithm
- machine learning