On derivative based bounding for simplicial branch and bound
Simplicial based Global Optimization branch and bound methods require tight bounds on the objective function value. Recently, a renewed interest appears on bound calculation based on Interval Arithmetic by Karhbet and Kearfott [ Reliable Comput. 25 (2017) 53–73] and on exploiting second derivative b...
Saved in:
Published in | R.A.I.R.O. Recherche opérationnelle Vol. 55; no. 3; pp. 2023 - 2034 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Paris
EDP Sciences
01.05.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!