A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints |
scientific article; zbMATH DE number 1801719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints |
scientific article; zbMATH DE number 1801719 |
Statements
A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (English)
0 references
17 September 2002
0 references
quadratic program
0 references
linear complementarity constraints
0 references
branch-and-bound algorithm
0 references
extreme point algorithm
0 references
globally
0 references
local search method
0 references
numerical experiment
0 references
0 references
0 references
0 references
0.8246207237243652
0 references
0.8140053153038025
0 references
0.8013302683830261
0 references
0.796740710735321
0 references
