FilMINT
FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. We describe a new solver for convex mixed-integer nonlinear programs (MINLPs) that implements a linearization-based algorithm. The solver is based on an algorithm of {it I. Quesada} and {it I. E. Grossmann} [“An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical Engrg. 16, No. 10--11, 937--947 (1992)] that avoids the complete re-solution of a master mixed-integer linear program (MILP) by adding new linearizations at open nodes of the branch-and-bound tree whenever an integer solution is found. The new solver, FilMINT, combines the MINTO branch-and-cut framework for MILP with filterSQP to solve the nonlinear programs that arise as subproblems in the algorithm. The MINTO framework allows us to easily employ cutting planes, primal heuristics, and other well-known MILP enhancements for MINLPs. We present detailed computational experiments that show the benefit of such advanced MILP techniques. We offer new suggestions for generating and managing linearizations that are shown to be efficient on a wide range of MINLPs. By carefully incorporating and tuning all these enhancements, an effective solver for convex MINLPs is constructed.
Keywords for this software
References in zbMATH (referenced in 41 articles , 1 standard article )
Showing results 1 to 20 of 41.
Sorted by year (- Lu, Jie; Gupte, Akshay; Huang, Yongxi: A mean-risk mixed integer nonlinear program for transportation network protection (2018)
- Kılınç, Mustafa R.; Linderoth, Jeff; Luedtke, James: Lift-and-project cuts for convex mixed integer nonlinear programs (2017)
- Vielma, Juan Pablo; Dunning, Iain; Huchette, Joey; Lubin, Miles: Extended formulations in mixed integer conic quadratic programming (2017)
- Frangioni, Antonio; Furini, Fabio; Gentile, Claudio: Approximated perspective relaxations: a project and lift approach (2016)
- Jakob Witzig, Timo Berthold, Stefan Heinz: Experiments with Conflict Analysis in Mixed Integer Programming (2016) arXiv
- Lubin, Miles; Yamangil, Emre; Bent, Russell; Vielma, Juan Pablo: Extended formulations in mixed-integer convex programming (2016)
- Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma: Polyhedral approximation in mixed-integer convex optimization (2016) arXiv
- Trespalacios, Francisco; Grossmann, Ignacio E.: Cutting plane algorithm for convex generalized disjunctive programs (2016)
- Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
- Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
- Hijazi, Hassan; Bonami, Pierre; Ouorou, Adam: An outer-inner approximation for separable mixed-integer nonlinear programs (2014)
- Kılınç, Mustafa; Linderoth, Jeff; Luedtke, James; Miller, Andrew: Strong-branching inequalities for convex mixed integer nonlinear programs (2014)
- Pytlak, Radosław; Tarnawski, Tomasz; Fajdek, Bartłomiej; Stachura, Marcin: Interactive dynamic optimization server -- connecting one modelling language with many solvers (2014)
- Belotti, Pietro: Bound reduction using pairs of linear inequalities (2013)
- D’ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: an updated practical overview (2013)
- Fortz, B.; Labbé, M.; Louveaux, F.; Poss, M.: Stochastic binary problems with simple penalties for capacity constraints violations (2013)
- Kirches, Christian; Leyffer, Sven: TACO: a toolkit for AMPL control optimization (2013)
- Berthold, Timo; Gleixner, Ambros M.; Heinz, Stefan; Vigerske, Stefan: Analyzing the computational impact of MIQCP solver components (2012)
- Berthold, Timo; Heinz, Stefan; Vigerske, Stefan: Extending a CIP framework to solve MIQCPs (2012)
- Bonami, Pierre; Gonçalves, João P. M.: Heuristics for convex mixed integer nonlinear programs (2012)