Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

DOI10.1007/BF01585567zbMath0847.90108MaRDI QIDQ1906278

Jia-Ming Cao

Publication date: 12 February 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

local minimaNP-completenonconvex quadratic programs0-1 quadratic programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs

Cites Work

• Open questions in complexity theory for numerical optimization
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• Une caractérisation complete des minima locaux en programmation quadratique
• Quadratic programming with one negative eigenvalue is NP-hard
• Local minima for indefinite quadratic knapsack problems
• On the solution of concave knapsack problems
• Some NP-complete problems in quadratic and nonlinear programming
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Unnamed Item

This page was built for publication: Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs