An interval branch and bound method for global robust optimization

DOI10.1007/s10898-021-01010-5zbMath1473.90101OpenAlexW3151690733MaRDI QIDQ2046260

Frédéric Messine, Emilio Carrizosa

Publication date: 17 August 2021

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

Full work available at URL: https://doi.org/10.1007/s10898-021-01010-5

zbMATH Keywords

branch and boundinterval arithmeticrobust optimization

Mathematics Subject Classification ID

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

Uses Software

• C-XSC
• C-XSC 2.0
• INTLAB
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reliable affine relaxation method for global optimization
• Min-max and robust polynomial optimization
• Robust optimization with simulated annealing
• General robust-optimization formulation for nonlinear programming
• Rigorous global search: continuous problems
• Robust optimization-methodology and applications
• Recent advances in robust optimization: an overview
• Robust global optimization with polynomials
• Robust Convex Optimization
• Nonconvex Robust Optimization for Problems with Constraints
• Robust Optimization for Unconstrained Simulation-Based Problems
• Theory and Applications of Robust Optimization
• INTLAB implementation of an interval global optimization algorithm
• The Price of Robustness
• A Deterministic Global Optimization Algorithm for Design Problems