Copositive realxation for genera quadratic programming
From MaRDI portal
Recommendations
Cites work
- A finite algorithm for solving general quadratic problems
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Block pivoting and shortcut strategies for detecting copositivity
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints
- Criteria for copositive matrices
- Finite criteria for conditional definiteness of quadratic forms
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 1047682 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- scientific article; zbMATH DE number 3350062 (Why is no real title available?)
- On copositive matrices
- On the asymptotic integer algorithm
- Quadratic-programming criteria for copositive matrices
- Semidefinite Programming
- Some applications of optimization in matrix theory
- Some NP-complete problems in quadratic and nonlinear programming
Cited in
(39)- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Simplified semidefinite and completely positive relaxations
- Building a completely positive factorization
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- Tightening a copositive relaxation for standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A new certificate for copositivity
- Algorithmic copositivity detection by simplicial partition
- D.C. versus copositive bounds for standard QP
- Partial Lagrangian relaxation for general quadratic programming
- Copositivity aspects of standard quadratic optimization problems
- New positive semidefinite relaxations for nonconvex quadratic programs
- On linear conic relaxation of discrete quadratic programs
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Foundations of set-semidefinite optimization
- Quadratic factorization heuristics for copositive programming
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- LMI approximations for the radius of the intersection of ellipsoids: Survey.
- On copositive programming and standard quadratic optimization problems
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- An algorithm for determining copositive matrices
- Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
- A square departure from symmetry in matrix cones
- Semidefinite programming for discrete optimization and matrix completion problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Copositive programming motivated bounds on the stability and the chromatic numbers
This page was built for publication: Copositive realxation for genera quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391294)
