Login / Signup
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.
Michel Baes
Alberto Del Pia
Yurii E. Nesterov
Shmuel Onn
Robert Weismantel
Published in:
Math. Program. (2012)
Keyphrases
</>
convex functions
integer points
convex hull
convex sets
linear program
dc programming
exact penalty
objective function
linear constraints
primal dual
piecewise linear
mixed integer
feasible solution
linear programming
hyperplane
valid inequalities
search algorithm
optimal solution