DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6310870
- scientific article; zbMATH DE number 7267266
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A new algorithm for the general quadratic programming problems with box constraints
Cites work
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A polyhedral branch-and-cut approach to global optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Linear programming relaxations of quadratically constrained quadratic programs
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Quadratic programming with one negative eigenvalue is NP-hard
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(12)- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- A branch-and-bound algorithm embedded with DCA for DC programming
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- A binarisation heuristic for non-convex quadratic programming with box constraints
- An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
- DC Programming Approaches for BMI and QMI Feasibility Problems
- scientific article; zbMATH DE number 6310870 (Why is no real title available?)
- scientific article; zbMATH DE number 7267266 (Why is no real title available?)
- A new algorithm for the general quadratic programming problems with box constraints
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
This page was built for publication: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723488)
