Convex-concave programming as a decomposition approach to global optimization (Q1373016)
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: Convex-concave programming as a decomposition approach to global optimization |
scientific article; zbMATH DE number 1083675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex-concave programming as a decomposition approach to global optimization |
scientific article; zbMATH DE number 1083675 |
Statements
Convex-concave programming as a decomposition approach to global optimization (English)
0 references
15 December 1997
0 references
adaptive subdivision
0 references
d.c. programming
0 references
convex-concave programs
0 references
decomposition
0 references
branch-and-bound
0 references
cutting plane
0 references
0.8289854526519775
0 references
0.8140407204627991
0 references
0.8109427690505981
0 references
