Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration.
Javad B. EbrahimiDamian StraszakNisheeth K. VishnoiPublished in: CoRR (2017)
Keyphrases
- objective function
- lower bound
- linear programming
- convex optimization
- semidefinite
- optimization problems
- global optimization
- high energy
- nonlinear programming
- convex relaxation
- fermentation process
- np hard
- quadratic optimization problems
- submodular functions
- image restoration
- integer programming
- cost function
- social networks
- security protection
- neural network