Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration.
Javad B. EbrahimiDamian StraszakNisheeth K. VishnoiPublished in: FOCS (2017)
Keyphrases
- objective function
- lower bound
- linear programming
- convex optimization
- convex relaxation
- global optimization
- optimization problems
- high energy
- nonlinear programming
- np hard
- semidefinite
- submodular functions
- linear programming relaxation
- security protection
- database
- convex functions
- branch and bound algorithm
- markov random field
- upper bound
- optimal solution
- information systems
- search engine
- information retrieval