On the Performance of NLP Solvers Within Global MINLP Solvers

DOI10.1007/978-3-319-89920-6_84zbMath1397.90422OpenAlexW2736161096MaRDI QIDQ4685828

Benjamin Müller, Stefan Vigerske, Renke Kuhlmann

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_84

zbMATH Keywords

global optimizationsequential quadratic programminginterior pointmixed-integer nonlinear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

More Virtuous Smoothing

Uses Software

• SCIP
• MINLP
• Ipopt
• WORHP

Cites Work

• Unnamed Item
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A global optimization algorithm for linear fractional and bilinear programs
• A branch-and-reduce approach to global optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• The ESA NLP Solver WORHP