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

DOI10.1007/s10898-018-0619-0zbMath1402.90132MaRDI QIDQ721144

Takahito Kuno

Publication date: 18 July 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0619-0

zbMATH Keywords

global optimization; branch-and-bound; convex maximization; \(\omega \)-subdivision; simplicial algorithm

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization