New bounds for subset selection from conic relaxations.

Walid Ben-Ameur José Neto

Published in: Eur. J. Oper. Res. (2022)

Keyphrases

subset selection
lower bound
upper bound
feature selection
hill climbing
upper bounding
upper and lower bounds
lower and upper bounds
np hard
worst case
linear programming
vc dimension
search algorithm
average case
straight line
neural network
search space
convex relaxation
objective function
machine learning