On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
DOI10.1007/S10898-021-01053-8zbMATH Open1475.90066OpenAlexW3179641373MaRDI QIDQ2046307FDOQ2046307
E. M. T. Hendrix, L. G. Casado, Frédéric Messine, 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rigorous global search: continuous problems
- Automatic differentiation: techniques and applications
- The computation of fixed points and applications
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Affine arithmetic: concepts and applications
- A general reliable quadratic form: An extension of affine arithmetic
- A reliable affine relaxation method for global optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Optimal centered forms
- Simplicial Global Optimization
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Tighter bound functions for nonconvex functions over simplexes
Cited In (1)
Uses Software
This page was built for publication: On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046307)
