Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem (Q5939945): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011224403708 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1599634084 / rank | |||
Normal rank | |||
Latest revision as of 08:59, 30 July 2024
scientific article; zbMATH DE number 1623508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem |
scientific article; zbMATH DE number 1623508 |
Statements
Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem (English)
0 references
10 February 2002
0 references
The authors propose new branch-and-bound and branch-and-cut algorithms to solve the bilinear matrix inequality eigenvalue problem. Numerical results on large randomly generated test problems are presented to compare between the new algorithm and some previously known algorithms.
0 references
bilinear matrix inequality eigenvalue problem
0 references
semidefinite programming
0 references
convex relaxation
0 references
cut polytope
0 references
branch-and-cut
0 references
branch-and-bound
0 references
algorithms
0 references
