A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484)
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 branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints |
scientific article; zbMATH DE number 6804403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints |
scientific article; zbMATH DE number 6804403 |
Statements
A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (English)
0 references
9 November 2017
0 references
quadratically constrained quadratic problems
0 references
nonconvex programming
0 references
branch and bound
0 references
sparse source localization
0 references
trust region subproblem
0 references
0 references
0.8121996521949768
0 references
0.8065683245658875
0 references
0.8058484196662903
0 references
0.7880333065986633
0 references
