Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration.
Javad B. EbrahimiDamian StraszakNisheeth K. VishnoiPublished in: SIAM J. Comput. (2020)
Keyphrases
- objective function
- lower bound
- linear programming
- convex optimization
- optimization problems
- convex relaxation
- nonlinear programming
- global optimization
- np hard
- greedy algorithm
- security protection
- high energy
- quadratic optimization problems
- semidefinite
- globally optimal
- approximation algorithms
- branch and bound algorithm
- upper bound
- stationary points
- evolutionary algorithm
- mixed integer nonlinear programming
- optimal solution
- information systems