Quadratic factorization heuristics for copositive programming
From MaRDI portal
Recommendations
- On copositive programming and standard quadratic optimization problems
- Quadratic-programming criteria for copositive matrices
- Copositive realxation for genera quadratic programming
- Copositivity aspects of standard quadratic optimization problems
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Completely positive and copositive program modelling for quadratic optimization problems
- Heuristic methods for linear multiplicative programming
- Representing quadratically constrained quadratic programs as generalized copositive programs
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- A decomposition method for quadratic programming
Cites work
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A comparison of the Delsarte and Lovász bounds
- A note on Burer's copositive representation of mixed-binary QPs
- Algorithmic copositivity detection by simplicial partition
- An adaptive linear approximation algorithm for copositive programs
- An improved characterisation of the interior of the completely positive cone
- Approximation of the stability number of a graph via copositive programming
- Constructing copositive matrices from interior matrices
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Interior points of the completely positive cone
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the Shannon capacity of a graph
- The sandwich theorem
Cited in
(16)- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Completely positive reformulations for polynomial optimization
- Copositive programming via semi-infinite optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- Approximation of copositive programming via linear programming using second order sum of square decomposition
- Testing copositivity with the help of difference-of-convex optimization
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On the computational complexity of membership problems for the completely positive cone and its dual
- Contribution of copositive formulations to the graph partitioning problem
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Completely positive and copositive program modelling for quadratic optimization problems
- An adaptive linear approximation algorithm for copositive programs
- Completely positive factorization by a Riemannian smoothing method
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- A discretization method for a class of copositive programming problems
This page was built for publication: Quadratic factorization heuristics for copositive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542052)
