Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions

DOI10.1023/A:1004656716776zbMath0970.90061OpenAlexW143209112MaRDI QIDQ5925735

Marco Locatelli, Ulrich Raber

Publication date: 19 February 2001

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

Full work available at URL: https://doi.org/10.1023/a:1004656716776

zbMATH Keywords

\(\omega\)-subdivisionsconcave minimizationfinitenesssimplicial branch and bound method

Mathematics Subject Classification ID

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

Related Items (4)

A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm ⋮ A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision

Cites Work

• Unnamed Item
• Checking local optimality in constrained quadratic programming is NP- hard
• A finite concave minimization algorithm using branch and bound and neighbor generation
• Subdivision of simplices relative to a cutting plane and finite concave minimization
• Introduction to global optimization
• A finite algorithm for concave minimization over a polyhedron
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Finite exact branch-and-bound algorithms for concave minimization over polytopes

This page was built for publication: Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions