Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
From MaRDI portal
Publication:4637830
DOI10.1080/10556788.2017.1350178zbMath1398.90110OpenAlexW2736798316MaRDI QIDQ4637830
Nikolaos V. Sahinidis, Mustafa R. Kılınç
Publication date: 3 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1350178
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, 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, The profit-oriented hub line location problem with elastic demand, Optimal Switching Sequence for Switched Linear Systems, 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, A solution method for heterogeneity involving present bias, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, BARON, Conflict Analysis for MINLP, Global optimality bounds for the placement of control valves in water supply networks, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Convex envelopes of products of convex and component-wise concave functions
- Heuristics for convex mixed integer nonlinear programs
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Deterministic global optimization in isothermal reactor network synthesis
- RENS. The optimal rounding
- A feasibility pump for mixed integer nonlinear programs
- A convex envelope formula for multilinear functions
- A finite algorithm for global minimization of separable concave programs
- Local branching
- A hybrid LP/NLP paradigm for global optimization relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Exploring relaxation induced neighborhoods to improve MIP solutions
- 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
- Branching rules revisited
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Convex envelopes generated from finitely many compact convex sets
- Conflict graphs in solving integer programming problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of nonconvex problems with multilinear intermediates
- Improving the feasibility pump
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Polyhedral Approaches to Mixed Integer Linear Programming
- Nonlinear Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Mixed-integer nonlinear optimization
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Benchmarking optimization software with performance profiles.
