DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
From MaRDI portal
Publication:723488
DOI10.1007/S11590-017-1203-0zbMATH Open1402.90109OpenAlexW2760977299MaRDI QIDQ723488FDOQ723488
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
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
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A polyhedral branch-and-cut approach to global optimization
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- 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
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Quadratic programming with one negative eigenvalue is NP-hard
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- 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
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- 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
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- A branch-and-bound algorithm embedded with DCA for DC programming
- DC Programming Approaches for BMI and QMI Feasibility Problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- A binarisation heuristic for non-convex quadratic programming with box constraints
Uses Software
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)
