Login / Signup
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems.
Sunyoung Kim
Masakazu Kojima
Kim-Chuan Toh
Published in:
Math. Program. (2016)
Keyphrases
</>
lower bound
significant improvement
high accuracy
dynamic programming
detection method
objective function
preprocessing
upper bound
clustering method
iterative algorithms
similarity measure
support vector
pairwise
cost function
linear regression
training process