An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.3934/jimo.2019104 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.3934/JIMO.2019104 / rank | |||
Normal rank | |||
Latest revision as of 20:15, 16 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
