Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1795205
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimality conditions for mixed integer nonlinear programming problems
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- On the global solution of multi-parametric mixed integer linear programming problems
- Sufficient global optimality conditions for general mixed integer nonlinear programming problems
- scientific article; zbMATH DE number 1857671
- Integral global optimization method for solution of nonlinear complementarity problems
- scientific article; zbMATH DE number 3883526
Cites work
- A branch-and-reduce approach to global optimization
- A convex envelope formula for multilinear functions
- A feasibility pump for mixed integer nonlinear programs
- A finite algorithm for global minimization of separable concave programs
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conflict graphs in solving integer programming problems
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of products of convex and component-wise concave functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization in isothermal reactor network synthesis
- Domain reduction techniques for global NLP and MINLP optimization
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex problems with multilinear intermediates
- GLOMIQO: global mixed-integer quadratic optimizer
- Heuristics for convex mixed integer nonlinear programs
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Improving the feasibility pump
- Local branching
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Nonlinear integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Polyhedral approaches to mixed integer linear programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- RENS. The optimal rounding
- Solving Large-Scale Zero-One Linear Programming Problems
- The global solver in the LINDO API
Cited in
(32)- BARON
- A hybrid LP/NLP paradigm for global optimization relaxations
- BARON: A general purpose global optimization software package
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Non-convex nested Benders decomposition
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
- A solution method for heterogeneity involving present bias
- Global optimality bounds for the placement of control valves in water supply networks
- scientific article; zbMATH DE number 1795205 (Why is no real title available?)
- Conflict Analysis for MINLP
- Optimal Switching Sequence for Switched Linear Systems
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- The profit-oriented hub line location problem with elastic demand
- Proportional packing of circles in a circular container
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- Comparison of MINLP formulations for global superstructure optimization
- Packing spheres with quasi-containment conditions
- Fast heuristics for the time-constrained immobile server problem
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Generalized Nash equilibrium problems with mixed-integer variables
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- Solving continuous and discrete nonlinear programs with BARON
- Convex mixed-integer optimization with Frank-Wolfe methods
- Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming
- 50 years of mixed-integer nonlinear and disjunctive programming
- A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
- Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
Describes a project that uses
Uses Software
This page was built for publication: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637830)
