A generalization of -subdivision ensuring convergence of the simplicial algorithm

DOI10.1007/S10589-015-9817-6MaRDI QIDQ286595zbMATH OpenOpenAlexFDO

Authors Takahito Kuno, Tomohiro Ishihama

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)

Recommendations

• A convergent simplicial algorithm with -subdivision and -bisection strategies
• 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
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions

Cites work

• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization
• A convergent simplicial algorithm with -subdivision and -bisection strategies
• A simplified convergence proof for the cone partitioning algorithm
• An algorithm for nonconvex programming problems
• Convergent Algorithms for Minimizing a Concave Function
• Convex Analysis
• 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
• Global optimization. Theory, algorithms, and applications
• Introduction to global optimization
• Normal conical algorithm for concave minimization over polytopes
• 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

(3)

• A convergent simplicial algorithm with -subdivision and -bisection strategies
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
• Finiteness of conical algorithms with \(\omega\)-subdivisions

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

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