Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373)
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: Global minimization of large-scale constrained concave quadratic problems by separable programming |
scientific article; zbMATH DE number 3963572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global minimization of large-scale constrained concave quadratic problems by separable programming |
scientific article; zbMATH DE number 3963572 |
Statements
Global minimization of large-scale constrained concave quadratic problems by separable programming (English)
0 references
1986
0 references
large-scale linearly constrained concave quadratic problem
0 references
separable programming
0 references
concave quadratic minimization
0 references
eigenvalue-eigenvector- decomposition
0 references
\(\epsilon \) -optimal solutions
0 references
0 references
0 references
0 references
0.7773020267486572
0 references
0.7771246433258057
0 references
0.7747121453285217
0 references
