On the Performance of NLP Solvers Within Global MINLP Solvers
From MaRDI portal
Recommendations
- Inexact solution of NLP subproblems in MINLP
- scientific article; zbMATH DE number 1054663
- Domain reduction techniques for global NLP and MINLP optimization
- scientific article; zbMATH DE number 1078157
- A hybrid LP/NLP paradigm for global optimization relaxations
- scientific article; zbMATH DE number 1054662
- A new global optimization method for univariate constrained twice-differentiable NLP problems
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- Reduction constraints for the global optimization of NLPs
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A global optimization algorithm for linear fractional and bilinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- The ESA NLP solver WORHP
Cited in
(6)- Domain reduction techniques for global NLP and MINLP optimization
- Analyzing the computational impact of MIQCP solver components
- scientific article; zbMATH DE number 1078157 (Why is no real title available?)
- Improving the performance of MIP and MINLP solvers by integrated heuristics
- More Virtuous Smoothing
- Algorithm for solving NLP problems with the use of a modified Lagrange function
This page was built for publication: On the Performance of NLP Solvers Within Global MINLP Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685828)