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

DOI10.1007/S10957-024-02480-9MaRDI QIDQ6644263FDOQ6644263

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)

zbMATH Keywords

facesimplexbranch and bounddirectional derivativemonotonic

Mathematics Subject Classification ID

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

Cites Work

• Introduction to Interval Analysis
• Title not available (Why is that?)
• An interval branch and bound algorithm for bound constrained optimization problems
• The cluster problem in multivariate global optimization
• Title not available (Why is that?)
• On generalized bisection of 𝑛-simplices
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Simplicial global optimization
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• Tighter bound functions for nonconvex functions over simplexes
• On monotonicity and search strategies in face-based copositivity detection algorithms
• On derivative based bounding for simplicial branch and bound

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)