DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs

DOI10.1007/s11590-017-1203-0zbMath1402.90109OpenAlexW2760977299MaRDI QIDQ723488

Zhi-bin Deng, Cheng Lu

Publication date: 31 July 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1203-0

zbMATH Keywords

global optimizationbranch-and-bound algorithmconvex relaxationquadratic programdifference-of-convex

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems

Uses Software

• SeDuMi
• QuadProgBB

Cites Work

• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Globally solving nonconvex quadratic programming problems via completely positive programming
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A polyhedral branch-and-cut approach to global optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
• Convex reformulation for binary quadratic programming problems via average objective value maximization
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Semidefinite Programming

This page was built for publication: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs