A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
Revision as of 09:12, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints |
scientific article |
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
