On the complexity of finding stationary points of nonconvex quadratic programs (Q1272568)
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: On the complexity of finding stationary points of nonconvex quadratic programs |
scientific article; zbMATH DE number 1234472
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding stationary points of nonconvex quadratic programs |
scientific article; zbMATH DE number 1234472 |
Statements
On the complexity of finding stationary points of nonconvex quadratic programs (English)
0 references
31 May 1999
0 references
linear complementarity problem
0 references
semidefinite symmetric matrix
0 references
