A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints

Cites Work

Unnamed Item
A conic approximation method for the 0-1 quadratic knapsack problem
Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints
A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Faster, but weaker, relaxations for quadratically constrained quadratic programs
Applications of second-order cone programming
Dichotomous binary differential evolution for knapsack problems
Convex reformulation for binary quadratic programming problems via average objective value maximization
An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
Hidden conic quadratic representation of some nonconvex quadratic optimization problems
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
Second order cone programming relaxation of nonconvex quadratic optimization problems
Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
On the simultaneous diagonalization of two semi-definite matrices
Quadratic knapsack problems
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Engineering and Economic Applications of Complementarity Problems
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

This page was built for publication: A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints