Using copositivity for global optimality criteria in concave quadratic programming problems

DOI10.1007/BF01585185zbMath0803.90097MaRDI QIDQ1319026

Immanuel M. Bomze, Gabriele Danninger

Publication date: 12 April 1994

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

zbMATH Keywords

global optimization; necessary and sufficient optimality conditions; dc-functions; linearly constrained concave quadratic minimization

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

Related Items

A copositivity probe, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Global optimality conditions for some classes of optimization problems, Using copositivity for global optimality criteria in concave quadratic programming problems, Necessary and sufficient global optimality conditions for convex maximization revisited, A test for copositive matrices, Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision, Block pivoting and shortcut strategies for detecting copositivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une caractérisation complete des minima locaux en programmation quadratique
• Using copositivity for global optimality criteria in concave quadratic programming problems
• On copositive matrices
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Remarks on the recursive structure of copositivity
• Some NP-complete problems in quadratic and nonlinear programming
• Necessary and sufficient conditions for quadratic minimality