A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm

DOI10.1007/s10589-015-9817-6zbMath1370.90192OpenAlexW2227210696MaRDI QIDQ286595

Tomohiro Ishihama, Takahito Kuno

Publication date: 25 May 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9817-6

zbMATH Keywords

global optimizationbranch-and-bound\(\omega \)-subdivisionsimplicial algorithmstrictly convex maximization

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• Normal conical algorithm for concave minimization over polytopes
• A simplified convergence proof for the cone partitioning algorithm
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Introduction to global optimization
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• Convex Analysis
• 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
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions

This page was built for publication: A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm