An interval branch and bound method for global robust optimization
type: Item
instance of: scholarly article
title: An interval branch and bound method for global robust optimization
zbMATH Open document ID: 1473.90101
author: Emilio Carrizosa
author: Frédéric Messine
published in: Journal of Global Optimization
publication date: 2021-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7382624
zbMATH Keywords: robust optimization
zbMATH Keywords: interval arithmetic
zbMATH Keywords: branch and bound
describes a project that uses: C-XSC 2.0
describes a project that uses: INTOPT_90
describes a project that uses: INTLAB
describes a project that uses: C-XSC
MaRDI profile type: Publication
full work available at URL: s10898-021-01010-5
OpenAlex ID: W3151690733
cites work: Robust convex optimization
cites work: Robust optimization-methodology and applications
cites work: Robust optimization with simulated annealing
cites work: The Price of Robustness
cites work: Nonconvex robust optimization for problems with constraints
cites work: Robust Optimization for Unconstrained Simulation-Based Problems
cites work: Theory and Applications of Robust Optimization
cites work: Recent advances in robust optimization: an overview
cites work: Q4445267
cites work: Rigorous global search: continuous problems
cites work: Q5286655
cites work: Robust global optimization with polynomials
cites work: Min-max and robust polynomial optimization
cites work: A Deterministic Global Optimization Algorithm for Design Problems
cites work: Q5566070
cites work: A reliable affine relaxation method for global optimization
cites work: INTLAB implementation of an interval global optimization algorithm
cites work: Q4040272
cites work: Q4949347
cites work: General robust-optimization formulation for nonlinear programming
DOI: 10.1007/S10898-021-01010-5
description: scientific article; zbMATH DE number 7382624