scientific article; zbMATH DE number 1795733
The author considers the nonconvex quadratic programming problem: \(\min \{f_0(x) \mid f_k(x) \leq 0\), \(k=1, \dots, m\), \(x \in X\}\), where \(X\) is a polyhedron in \(R^n\) and \(f_k(x)=1/2 \langle x, Q^k x \rangle+ \langle c^k, x\rangle+ b^k\) with \(Q^k\) being \(n \times n\) symmetric real matrices, \(k=0, \dots, m\). The purpose of the paper is to study a general class of branch and bound algorithms for solving the problem. In these algorithms bounds satisfy a certain tightness condition, while branching exploits this property to accelerate the convergence. For the entire collection see [Zbl 0988.00046].
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- An algorithm for indefinite quadratic programming with convex constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
- scientific article; zbMATH DE number 6310870
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550783)