Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728)
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: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems |
scientific article; zbMATH DE number 4062831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems |
scientific article; zbMATH DE number 4062831 |
Statements
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (English)
0 references
1988
0 references
restart procedure
0 references
d.c. optimization.
0 references
branch-and-bound
0 references
global optimization
0 references
grid-search techniques
0 references
outer approximation
0 references
concave minimization
0 references
difference of two convex functions
0 references
0 references
0 references
0 references
0 references
0.90499985
0 references
0.8801333
0 references
0.87944907
0 references
0.87859964
0 references
0.87669164
0 references
0.8761115
0 references
0.87269986
0 references
0.87264204
0 references
