A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies

DOI10.1007/s10898-011-9746-6zbMath1268.90053MaRDI QIDQ427360

Takahito Kuno, Paul E. K. Buckland

Publication date: 13 June 2012

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

Full work available at URL: https://doi.org/10.1007/s10898-011-9746-6

zbMATH Keywords

global optimization; branch-and-bound; convex maximization; simplicial algorithm; subdivision strategy

Mathematics Subject Classification ID

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

90C26: Nonconvex programming, global optimization

Uses Software

• Octave

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplified convergence proof for the cone partitioning algorithm
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Introduction to global optimization
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
• An algorithm for nonconvex programming 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
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions