Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
Revision as of 08:15, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming |
scientific article |
Statements
Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (English)
0 references
5 February 2019
0 references
quadratic programs with complementarity constraints
0 references
augmented Lagrangian method
0 references
branch and bound
0 references
doubly nonnegative relaxation
0 references
semidefinite programming
0 references
