On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions |
scientific article; zbMATH DE number 1566520
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions |
scientific article; zbMATH DE number 1566520 |
Statements
On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (English)
0 references
19 February 2001
0 references
concave minimization
0 references
\(\omega\)-subdivisions
0 references
convergence
0 references
simplicial branch and bound method
0 references
For solving concave minimization problems, \textit{R. Horst} [Math. Programming. 10, 312-321 (1976; Zbl 0337.90062)] introduced a simplicial branch and bound method based on \(\omega\)-subdivisions. This paper provides a convergence proof for this method.
0 references
0 references
