On the complexity of finding stationary points of nonconvex quadratic programs

zbMath0913.90224MaRDI QIDQ1272568

Katta G. Murty, Joaquim Joao Júdice

Publication date: 31 May 1999

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemsemidefinite symmetric matrix

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

On the solution of NP-hard linear complementarity problems