Login / Signup
On Non-Approximability for Quadratic Programs
Sanjeev Arora
Eli Berger
Elad Hazan
Guy Kindler
Muli Safra
Published in:
Electron. Colloquium Comput. Complex. (2005)
Keyphrases
</>
quadratic program
approximation algorithms
np hard
linear program
linear constraints
special case
worst case
convex optimization
quadratic programming
mixed integer
linear programming
maximum margin
parameter selection
active learning
least squares
objective function
lower bound
computational complexity