No label defined (Q4550783)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1795733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1795733 |
Statements
27 October 2003
0 references
0.8741548657417297
0 references
0.8272634148597717
0 references
0.8258445262908936
0 references
0.8212049007415771
0 references
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].
0 references