A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.
Walid Ben-AmeurJosé NetoPublished in: Discret. Appl. Math. (2011)
Keyphrases
- recursive algorithm
- quadratic optimization problems
- upper bound
- hypothesis testing
- special case
- worst case
- computational complexity
- minimum mean square error
- convex hull
- approximation algorithms
- approximation ratio
- np hard
- lower bound
- precision and recall
- finite automata
- np hardness
- active learning
- reinforcement learning