An SDP Primal-Dual Approximation Algorithm for Directed Hypergraph Expansion and Sparsest Cut with Product Demands.
T.-H. Hubert ChanBintao SunPublished in: CoRR (2018)
Keyphrases
- primal dual
- integrality gap
- semidefinite programming
- linear programming
- dynamic programming
- approximation algorithms
- convergence rate
- np hard
- affine scaling
- convex optimization
- linear program
- computational complexity
- simplex method
- simplex algorithm
- interior point algorithm
- randomly generated
- lower bound
- algorithm for linear programming
- optimal solution
- natural images
- higher order
- worst case
- linear programming problems
- dual formulation