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

DOI10.1155/2020/5717301MaRDI QIDQ6534829zbMATH OpenFDO

Authors Jing Zhou

Publication date 18 May 2021

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

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

• scientific article; zbMATH DE number 5912573 (Why is no real title available?)
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
• A conic approximation method for the 0-1 quadratic knapsack problem
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
• An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
• Applications of second-order cone programming
• Convex reformulation for binary quadratic programming problems via average objective value maximization
• Dichotomous binary differential evolution for knapsack problems
• Engineering and Economic Applications of Complementarity Problems
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• On the simultaneous diagonalization of two semi-definite matrices
• Quadratic knapsack problems
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
• Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534829)