Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338)
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 7904930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching |
scientific article; zbMATH DE number 7904930 |
Statements
Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (English)
0 references
2 September 2024
0 references
semidefinite programming
0 references
semidefinite optimization
0 references
conic optimization
0 references
nonconvex quadratic programming
0 references
trust region subproblem
0 references
0 references
0 references
0 references
0.806219756603241
0 references
0.7854282855987549
0 references
0.7827668190002441
0 references
0.7765215039253235
0 references
0.7678341269493103
0 references
