A convergent simplicial algorithm with -subdivision and -bisection strategies

DOI10.1007/S10898-011-9746-6MaRDI QIDQ427360zbMATH OpenOpenAlexFDO

Authors 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 optimizationbranch-and-boundsimplicial algorithmconvex maximizationsubdivision strategy

Mathematics Subject Classification ID

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

Recommendations

• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• A generalization of -subdivision ensuring convergence of the simplicial algorithm
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 2190131 (Why is no real title available?)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
• A simplified convergence proof for the cone partitioning algorithm
• An Algorithm for Separable Nonconvex Programming Problems
• An algorithm for nonconvex programming problems
• Convex analysis and global optimization
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Introduction to global optimization
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions

Cited in

(5)

• Algorithm 860
• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision

Describes a project that uses

Uses Software

• Octave

This page was built for publication: A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427360)