On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound

DOI10.1007/s10957-024-02480-9MaRDI QIDQ6644263

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

Publication date: 27 November 2024

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

facebranch and boundsimplexdirectional derivativemonotonic

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• An interval branch and bound algorithm for bound constrained optimization problems
• The cluster problem in multivariate global optimization
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• On monotonicity and search strategies in face-based copositivity detection algorithms
• Simplicial Global Optimization
• On generalized bisection of 𝑛-simplices
• Introduction to Interval Analysis
• On derivative based bounding for simplicial branch and bound
• Tighter bound functions for nonconvex functions over simplexes

This page was built for publication: On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound