Alternative Regularizations for OA Algorithms for Convex MINLP

In this work, we extend the regularization framework from Kronqvist et al. ( by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance-metrics and Lagrangean approximations, used in the projection problem for finding new … Read more