New semidefinite programming relaxations for box constrained quadratic program
From MaRDI portal
Recommendations
- Relaxing the optimality conditions of box QP
- Linear programming relaxations of quadratically constrained quadratic programs
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Semidefinite programming relaxation for nonconvex quadratic programs
- New positive semidefinite relaxations for nonconvex quadratic programs
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- A polynomial case of unconstrained zero-one quadratic optimization
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Approximating quadratic programming with bound and quadratic constraints
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- On duality gap in binary quadratic programming
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Reverse search for enumeration
- Semidefinite Programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
Cited in
(8)- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Relaxing the optimality conditions of box QP
- Partially positive matrices
- Parametric Lagrangian dual for the binary quadratic programming problem
- A class of differential quadratic programming problems
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- A feasible direction method for the semidefinite program with box constraints
This page was built for publication: New semidefinite programming relaxations for box constrained quadratic program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q365811)
