Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3934/jimo.2017064 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2658328683 / rank | |||
Normal rank | |||
Revision as of 01:42, 20 March 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
