New dual-type decomposition algorithm for non-convex separable optimization problems (Q1826106)
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: New dual-type decomposition algorithm for non-convex separable optimization problems |
scientific article; zbMATH DE number 4122716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New dual-type decomposition algorithm for non-convex separable optimization problems |
scientific article; zbMATH DE number 4122716 |
Statements
New dual-type decomposition algorithm for non-convex separable optimization problems (English)
0 references
1989
0 references
dual-type decomposition algorithm
0 references
large-scale nonconvex optimization problems
0 references
augmented Lagrange function
0 references
separable local optimization problems
0 references
0 references
0 references
0 references
0 references
0.92786336
0 references
0.9187154
0 references
0.91324306
0 references
0.90471345
0 references
0.9003674
0 references
0.89725363
0 references
