On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
From MaRDI portal
Publication:5925734
DOI10.1023/A:1004604732705zbMath0970.90062OpenAlexW64386930MaRDI QIDQ5925734
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:1004604732705
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (5)
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 ⋮ Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
Cites Work
- On the global minimization of concave functions
- Checking local optimality in constrained quadratic programming is NP- hard
- Normal conical algorithm for concave minimization over polytopes
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- A simplified convergence proof for the cone partitioning algorithm
- Finiteness of conical algorithms with \(\omega\)-subdivisions
- Introduction to global optimization
- Methods for Global Concave Minimization: A Bibliographic Survey
- An algorithm for nonconvex programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
