A numerical study of MIDACO on 100 MINLP benchmarks

DOI10.1080/02331934.2012.668545zbMath1260.90149OpenAlexW2062458514MaRDI QIDQ3165903

Matthias Gerdts, Martin Schlüter, Jan-Joachim Rückmann

Publication date: 19 October 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.668545

zbMATH Keywords

parallel computingmixed integer nonlinear programmingant colony optimizationoracle penalty method\texttt{BONMIN}\texttt{COUENNE}\texttt{MIDACO}\texttt{MISQP}

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (2)

An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ MIDACO

Uses Software

• MINLP
• Schittkowski
• MINLPLib
• MINLPB4
• MISQPN

Cites Work

• Ant colony optimization for continuous domains
• The oracle penalty method
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• Review of nonlinear mixed-integer and disjunctive programming techniques
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
• Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
• A Note on the Generation of Random Normal Deviates

This page was built for publication: A numerical study of MIDACO on 100 MINLP benchmarks