Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
From MaRDI portal
Recommendations
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A linear programming reformulation of the standard quadratic optimization problem
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
Cites work
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- An adaptive linear approximation algorithm for copositive programs
- An improved algorithm to test copositivity
- Approximation of the stability number of a graph via copositive programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Geometry of the copositive and completely positive cones
- Global optimization with polynomials and the problem of moments
- Interior points of the completely positive cone
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New approximations for the cone of copositive matrices and its dual
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Quadratic programming is in NP
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some NP-complete problems in quadratic and nonlinear programming
Cited in
(15)- On copositive programming and standard quadratic optimization problems
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
- Improved approximation results on standard quartic polynomial optimization
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A linear programming reformulation of the standard quadratic optimization problem
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Copositivity aspects of standard quadratic optimization problems
- An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
- A refined error analysis for fixed-degree polynomial optimization over the simplex
- On the accuracy of uniform polyhedral approximations of the copositive cone
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- scientific article; zbMATH DE number 6474937 (Why is no real title available?)
- A new branch-and-bound algorithm for standard quadratic programming problems
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
This page was built for publication: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496589)
