Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions
From MaRDI portal
Cites work
- A reformulation framework for global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- BARON: A general purpose global optimization software package
- Branching and bounds tighteningtechniques for non-convex MINLP
- Classification of the Dubins set
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Global optimization of mixed-integer signomial programming problems
- Incremental and encoding formulations for mixed integer programming
- JuMP: a modeling language for mathematical optimization
- Julia: a fresh approach to numerical computing
- Markov-Dubins interpolating curves
- Mixed integer linear programming formulation techniques
- Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- On the Theory of Dynamic Programming
- SCIP: solving constraint integer programs
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Some transformation techniques in global optimization
- The global solver in the LINDO API
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
This page was built for publication: Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892810)
