Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ANTIGONE / rank | |||
Normal rank | |||
Revision as of 09:34, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence-order analysis of branch-and-bound algorithms for constrained problems |
scientific article |
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
