A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CVX / rank | |||
Normal rank | |||
Revision as of 01:24, 29 February 2024
scientific article; zbMATH DE number 6865939
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems |
scientific article; zbMATH DE number 6865939 |
Statements
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (English)
0 references
3 May 2018
0 references
branch-and-cut algorithm
0 references
nonconvex quadratically constrained quadratic programming
0 references
polar cut
0 references
semidefinite relaxation
0 references
