A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ ω -subdivision

Takahito Kuno ()
Additional contact information
Takahito Kuno: University of Tsukuba

Journal of Global Optimization, 2018, vol. 71, issue 2, No 2, 297-311

Abstract: 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 overcome those, we modify the bounding process and extend the $$\omega $$ ω -subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.

Keywords: Global optimization; Convex maximization; Branch-and-bound; Simplicial algorithm; $$\omega $$ ω -Subdivision (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-018-0619-0 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:jglopt:v:71:y:2018:i:2:d:10.1007_s10898-018-0619-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-018-0619-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

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