COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS

DOI10.1142/S0218348X22402496OpenAlexW4311300230MaRDI QIDQ5880744

Loay Alkhalifa

Publication date: 6 March 2023

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x22402496

zbMATH Keywords

branch and boundouter approximationmixed integer nonlinear programmingpiecewise linear approximation

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Operations research, mathematical programming (90-XX)

Uses Software

• BARON
• SCIP
• LINDO
• MINLP
• LINDOGlobal
• GloMIQO
• ANTIGONE

Cites Work

• GLOMIQO: global mixed-integer quadratic optimizer
• SCIP: solving constraint integer programs
• A new reformulation-linearization technique for bilinear programming problems
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A branch-and-reduce approach to global optimization
• BARON: A general purpose global optimization software package
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Modelling with integer variables
• On the Solution of Discrete Programming Problems
• Outline of an algorithm for integer solutions to linear programs
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• An Automatic Method of Solving Discrete Programming Problems
• Branching and bounds tighteningtechniques for non-convex MINLP
• The global solver in the LINDO API
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• Jointly Constrained Biconvex Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS