On the complexity of finding stationary points of nonconvex quadratic programs (Q1272568): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding stationary points of nonconvex quadratic programs |
scientific article |
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
