Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming (Q5423153)
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 5203364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming |
scientific article; zbMATH DE number 5203364 |
Statements
Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming (English)
0 references
22 October 2007
0 references
Quadratic programming
0 references
superfluous restrictions
0 references
interior-point method
0 references
object-oriented software
0 references
0 references
0 references
0.8630439639091492
0 references
0.7784629464149475
0 references
0.763648509979248
0 references
0.7567375302314758
0 references
