Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6928827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence-order analysis of branch-and-bound algorithms for constrained problems |
scientific article; zbMATH DE number 6928827 |
Statements
Convergence-order analysis of branch-and-bound algorithms for constrained problems (English)
0 references
29 August 2018
0 references
global optimization
0 references
constrained optimization
0 references
convergence order
0 references
convex relaxation
0 references
Lagrangian dual
0 references
branch-and-bound
0 references
lower bounding scheme
0 references
reduced-space
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8074658513069153
0 references
0.773268461227417
0 references
0.7653238773345947
0 references
0.7591409683227539
0 references
0.7559342980384827
0 references
