IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming (Q6064060)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7762788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming |
scientific article; zbMATH DE number 7762788 |
Statements
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming (English)
0 references
8 November 2023
0 references
convex quadratic programming
0 references
interior-point relaxation method
0 references
smoothing barrier augmented Lagrangian
0 references
infeasibility detection
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8131535649299622
0 references
0.8031550049781799
0 references
0.799394965171814
0 references
0.798919677734375
0 references
0.7920849323272705
0 references
