Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LINDO / rank | |||
Normal rank | |||
Revision as of 22:11, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global minimization of large-scale constrained concave quadratic problems by separable programming |
scientific article |
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
