Convex reformulation for binary quadratic programming problems via average objective value maximization.

Cheng Lu Xiaoling Guo

Published in: Optim. Lett. (2015)

Keyphrases

quadratic programming problems
equality constraints
data sets
learning algorithm
objective function
support vector machine
convex hull
artificial neural networks
particle swarm optimization
sufficient conditions
fixed point
convergence rate