Greedy and IHT Algorithms for Non-convex Optimization with Monotone Costs of Non-zeros.
Shinsaku SakauePublished in: AISTATS (2019)
Keyphrases
- convex optimization
- convex optimization problems
- interior point
- interior point methods
- low rank
- worst case
- learning algorithm
- total variation
- quadratic program
- greedy algorithm
- machine learning algorithms
- pairwise
- computationally intensive
- primal dual
- computational complexity
- image processing
- machine learning
- norm minimization
- alternating direction method of multipliers
- operator splitting