A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
From MaRDI portal
Publication:6534829
DOI10.1155/2020/5717301zbMATH Open1544.90135MaRDI QIDQ6534829FDOQ6534829
Authors: Jing Zhou 
Publication date: 18 May 2021
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 7366738
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- A new convex relaxation for quadratically constrained quadratic programming
- Global optimization of quadratic programming problems with quadratic constraints
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On the simultaneous diagonalization of two semi-definite matrices
- Applications of second-order cone programming
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Engineering and Economic Applications of Complementarity Problems
- Quadratic knapsack problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- 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
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Title not available (Why is that?)
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Dichotomous binary differential evolution for knapsack problems
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
This page was built for publication: A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534829)
