A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ω-subdivision
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Global Optimization"
DOI: 10.1007/s10898-018-0619-0
Abstract: The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the $$\omega $$ω-subdivision rule. To… read more here.
Keywords: simplicial algorithm; omega subdivision; subdivision; convex maximization ... See more keywords