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

DOI10.1007/S10957-024-02480-9MaRDI QIDQ6644263zbMATH OpenFDO

Authors Boglárka G.-Tóth, E. M. T. Hendrix, L. G. Casado, Frédéric Messine

Publication date 27 November 2024

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

facesimplexbranch and bounddirectional derivativemonotonic

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 2035082 (Why is no real title available?)
• An interval branch and bound algorithm for bound constrained optimization problems
• Introduction to Interval Analysis
• On derivative based bounding for simplicial branch and bound
• On generalized bisection of 𝑛-simplices
• On monotonicity and search strategies in face-based copositivity detection algorithms
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
• Simplicial global optimization
• The cluster problem in multivariate global optimization
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644263)