Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization.
Riley BadenbroekEtienne de KlerkPublished in: Math. Oper. Res. (2022)
Keyphrases
- complexity analysis
- interior point methods
- convex optimization
- convex programming
- primal dual
- theoretical analysis
- linear programming problems
- convex optimization problems
- low rank
- lower bound
- total variation
- norm minimization
- computational complexity
- first order logic
- convex relaxation
- semidefinite
- approximation algorithms
- machine learning
- linear programming
- image processing
- computer vision