On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

DOI10.1007/s10898-021-01053-8zbMath1475.90066OpenAlexW3179641373MaRDI QIDQ2046307

Frédéric Messine, Eligius M. T. Hendrix, Leocadio G. Casado, Boglárka G.-Tóth

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-01053-8

zbMATH Keywords

linear programmingbranch-and-boundinterval arithmeticsimplexaffine arithmetic

Mathematics Subject Classification ID

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

Uses Software

• Virtual library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reliable affine relaxation method for global optimization
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
• Optimal centered forms
• Automatic differentiation: techniques and applications
• The computation of fixed points and applications
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Rigorous global search: continuous problems
• Affine arithmetic: concepts and applications
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
• A general reliable quadratic form: An extension of affine arithmetic
• Simplicial Global Optimization
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• Tighter bound functions for nonconvex functions over simplexes