Outer-approximation algorithms for nonsmooth convex MINLP problems
Sign Up to like & getrecommendations! Published in 2018 at "Optimization"
DOI: 10.1080/02331934.2018.1434173
Abstract: Abstract In this work, we combine outer-approximation (OA) and bundle method algorithms for dealing with mixed-integer non-linear programming (MINLP) problems with nonsmooth convex objective and constraint functions. As the convergence analysis of OA methods relies… read more here.
Keywords: convex minlp; nonsmooth convex; outer approximation; minlp problems ... See more keywords
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2019.1641498
Abstract: ABSTRACT The solver DICOPT is based on the outer-approximation algorithm used for solving mixed-integer nonlinear programming (MINLP) problems. This algorithm is very effective for solving some types of convex MINLPs. However, it has been observed… read more here.
Keywords: dicopt; algorithm; feasibility pump; convex ... See more keywords