An infeasible interior-point algorithm for convex quadratic programming with full-Newton step (Q2924312)
From MaRDI portal
!
WARNING
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 6364783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infeasible interior-point algorithm for convex quadratic programming with full-Newton step |
scientific article; zbMATH DE number 6364783 |
Statements
3 November 2014
0 references
convex quadratic programming
0 references
infeasible interior-point algorithm
0 references
full-Newton step
0 references
polynomial complexity
0 references
An infeasible interior-point algorithm for convex quadratic programming with full-Newton step (English)
0 references
0.8937439918518066
0 references
0.8853214383125305
0 references
0.8844879269599915
0 references
