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

DOI10.1007/s10898-018-0619-0zbMath1402.90132OpenAlexW2793383223MaRDI 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 optimizationbranch-and-boundconvex maximization\(\omega \)-subdivisionsimplicial algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• Introduction to global optimization
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• An algorithm for nonconvex programming problems
• Variational Analysis
• Computationally Related Problems
• An Algorithm for Separable Nonconvex Programming Problems
• Convex analysis and global optimization
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions

This page was built for publication: A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision