On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound

Boglárka G.-Tóth (), Eligius M. T. Hendrix (), Leocadio G. Casado () and Frédéric Messine ()
Additional contact information
Boglárka G.-Tóth: University of Szeged
Eligius M. T. Hendrix: Universidad de Málaga
Leocadio G. Casado: University of Almería, CeiA3
Frédéric Messine: University of Toulouse

Journal of Optimization Theory and Applications, 2024, vol. 203, issue 2, No 30, 1880-1909

Abstract: Abstract We consider a simplicial branch and bound Global Optimization algorithm, where the search region is a simplex. Apart from using longest edge bisection, a simplicial partition set can be reduced due to monotonicity of the objective function. If there is a direction in which the objective function is monotone over a simplex, depending on whether the facets that may contain the minimum are at the border of the search region, we can remove the simplex completely, or reduce it to some of its border facets. Our research question deals with finding monotone directions and labeling facets of a simplex as border after longest edge bisection and reduction due to monotonicity. Experimental results are shown over a set of global optimization problems where the feasible set is defined as a simplex, and a global minimum point is located at a face of the simplicial feasible area.

Keywords: Simplex; Branch and bound; Monotonic; Directional derivative; Face (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-024-02480-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:203:y:2024:i:2:d:10.1007_s10957-024-02480-9

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-024-02480-9

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().