Copositive realxation for genera quadratic programming
From MaRDI portal
Publication:4391294
DOI10.1080/10556789808805692zbMath0904.90126OpenAlexW2015775145MaRDI QIDQ4391294
Tamás Terlaky, Arie J. Quist, Etienne de Klerk, Cornelis Roos
Publication date: 2 June 1998
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805692
Related Items (22)
Copositive programming motivated bounds on the stability and the chromatic numbers ⋮ A note on set-semidefinite relaxations of nonconvex quadratic programs ⋮ A new certificate for copositivity ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An algorithm for determining copositive matrices ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Algorithmic copositivity detection by simplicial partition ⋮ LMI approximations for the radius of the intersection of ellipsoids: Survey. ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ Foundations of Set-Semidefinite Optimization ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Building a completely positive factorization ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Role of redundant constraints for improving dual bounds in polynomial optimization problems ⋮ Exploiting symmetry in copositive programs via semidefinite hierarchies ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Criteria for copositive matrices
- Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints
- Finite criteria for conditional definiteness of quadratic forms
- Some applications of optimization in matrix theory
- A finite algorithm for solving general quadratic problems
- Quadratic-programming criteria for copositive matrices
- On copositive matrices
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On the asymptotic integer algorithm
- Block pivoting and shortcut strategies for detecting copositivity
- Some NP-complete problems in quadratic and nonlinear programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Semidefinite Programming
This page was built for publication: Copositive realxation for genera quadratic programming