Using copositivity for global optimality criteria in concave quadratic programming problems
From MaRDI portal
Publication:1319026
DOI10.1007/BF01585185zbMath0803.90097OpenAlexW1968098173MaRDI QIDQ1319026
Immanuel M. Bomze, Gabriele Danninger
Publication date: 12 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585185
global optimizationnecessary and sufficient optimality conditionsdc-functionslinearly constrained concave quadratic minimization
Related Items (10)
Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Necessary and sufficient global optimality conditions for convex maximization revisited ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Global optimality conditions for some classes of optimization problems ⋮ A copositivity probe ⋮ Block pivoting and shortcut strategies for detecting copositivity ⋮ A test for copositive matrices ⋮ Using copositivity for global optimality criteria in concave quadratic programming problems
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
This page was built for publication: Using copositivity for global optimality criteria in concave quadratic programming problems
