Role of copositivity in optimality criteria for nonconvex optimization problems

DOI10.1007/BF00940491zbMath0792.90058MaRDI QIDQ1321274

Gabriele Danninger

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

concave minimizationconstrained optimizationconvex maximizationglobal optimality conditionscopositive matriceslocal optimalitysecond-order necessary and sufficient conditionsconcave quadratic problemscopositivity conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Necessary and sufficient global optimality conditions for convex maximization revisited, Minimum distance to the complement of a convex set: Duality result, A branch-and-reduce approach to global optimization, Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, An algorithm for determining copositive matrices, Algorithmic copositivity detection by simplicial partition, Global optimality conditions for quadratic \(0-1\) optimization problems, Foundations of Set-Semidefinite Optimization, A copositivity probe, Copositivity for second-order optimality conditions in general smooth optimization problems, A test for copositive matrices

Cites Work

• Checking local optimality in constrained quadratic programming is NP- hard
• On copositive matrices
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Remarks on the recursive structure of copositivity
• Some NP-complete problems in quadratic and nonlinear programming
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item