A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

DOI10.3934/jimo.2019044zbMath1476.90275OpenAlexW2945970690WikidataQ127769398 ScholiaQ127769398MaRDI QIDQ2244199

Jing Zhou, Zhi-bin Deng

Publication date: 12 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2019044

zbMATH Keywords

branch-and-bound algorithmsemidefinite programming relaxationnonconvex quadratic programsecond order cone programming relaxationdifference of convex decomposition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)

Related Items (1)

A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program

Uses Software

• SeDuMi
• QuadProgBB

Cites Work

• Unnamed Item
• Unnamed Item
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Globally solving nonconvex quadratic programming problems via completely positive programming
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
• Conic approximation to quadratic optimization with linear complementarity constraints
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Solutions and optimality criteria to box constrained nonconvex minimization problems
• The trust region subproblem with non-intersecting linear constraints
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• A Note on Polynomial Solvability of the CDT Problem
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving trust-region subproblem augmented with linear inequality constraints
• On Cones of Nonnegative Quadratic Functions

This page was built for publication: A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs