Using the primal-dual interior point algorithm within the branch-price-and-cut method.

Pedro Augusto Munari Jacek Gondzio

Published in: Comput. Oper. Res. (2013)

Keyphrases

interior point algorithm
primal dual
linear programming
interior point methods
convex optimization
multiscale
objective function
special case
support vector machine
convergence rate
affine scaling
dynamic programming
denoising
sufficient conditions
model selection
semidefinite programming