Some observations on exclusion regions in branch and bound algorithms

DOI10.1007/s10898-014-0248-1zbMath1346.90821OpenAlexW1999716527MaRDI QIDQ2349518

Ralph Baker Kearfott

Publication date: 22 June 2015

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

Full work available at URL: https://doi.org/10.1007/s10898-014-0248-1

zbMATH Keywords

branch and boundinterval computationscluster problemepsilon-inflationcomplete searchbackboxing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Uses Software

• BARON
• INTLAB
• INTOPT_90
• GlobSol
• Numerica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On smooth reformulations and direct non-smooth computations for minimax problems
• On proving existence of feasible points in equality constrained optimization problems
• The cluster problem in multivariate global optimization
• Epsilon-inflation in verification algorithms
• BARON: A general purpose global optimization software package
• Rigorous verification of feasibility
• On rigorous upper bounds to a global optimum
• Exclusion regions for optimization problems
• GlobSol user guide
• Abstract Generalized Bisection and a Cost Bound
• Exclusion Regions for Systems of Equations
• Complete search in continuous global optimization and constraint satisfaction