Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580762 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986778884 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems |
scientific article |
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
