An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:04, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem |
scientific article |
Statements
An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (English)
0 references
9 June 2021
0 references
second-order cone programming relaxation
0 references
semidefinite programming relaxation
0 references
branch-and-bound algorithm
0 references
trust-region problem
0 references
simultaneous diagonalization
0 references
