Greedy algorithms in convex optimization on Banach spaces.
Vladimir N. TemlyakovPublished in: ACSSC (2014)
Keyphrases
- convex formulation
- convex optimization
- greedy algorithms
- greedy algorithm
- interior point methods
- convex relaxation
- low rank
- primal dual
- knapsack problem
- convex optimization problems
- total variation
- norm minimization
- machine learning
- convex constraints
- image processing
- learning algorithm
- worst case
- semi definite programming