An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver

DOI10.1007/s10898-017-0559-0zbMath1393.90076OpenAlexW2745993358MaRDI QIDQ1704912

Peng Zhang

Publication date: 13 March 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0559-0

zbMATH Keywords

global optimizationparallel computingmixed integer linear programmingmixed integer nonlinear programmingmulticore architecturesportfolios of relaxations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ Non-convex nested Benders decomposition ⋮ On generalized surrogate duality in mixed-integer nonlinear programming

Uses Software

• BARON
• SCIP
• UG
• MIPLIB
• CPLEX
• LINDO
• XPRESS
• MINLPLib
• LINDOGlobal
• ParaSCIP
• ANTIGONE

Cites Work

• Unnamed Item
• Global optimization. Scientific and engineering case studies
• A review of recent advances in global optimization
• A finite algorithm for global minimization of separable concave programs
• Convex extensions and envelopes of lower semi-continuous functions
• A hybrid LP/NLP paradigm for global optimization relaxations
• 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
• Product disaggregation in global optimization and relaxations of rational programs
• Solving large MINLPs on computational grids
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Introduction to global optimization
• A branch-and-reduce approach to global optimization
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• The global solver in the LINDO API
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Global Optimization and Constraint Satisfaction
• Benchmarking optimization software with performance profiles.