A convergent simplicial algorithm with -subdivision and -bisection strategies

DOI10.1007/S10898-011-9746-6zbMATH Open1268.90053OpenAlexW2058863922MaRDI QIDQ427360FDOQ427360

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

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 \(\omega \)-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

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)

Cites Work

• Title not available (Why is that?)
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• An Algorithm for Separable Nonconvex Programming Problems
• Introduction to global optimization
• Convex analysis and global optimization
• A simplified convergence proof for the cone partitioning algorithm
• An algorithm for nonconvex programming problems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
• Title not available (Why is that?)

Cited In (5)

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

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)