A primal-infeasible interior point algorithm for linearly constrained convex programming (Q2932930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A primal-infeasible interior point algorithm for linearly constrained convex programming |
scientific article; zbMATH DE number 6378892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-infeasible interior point algorithm for linearly constrained convex programming |
scientific article; zbMATH DE number 6378892 |
Statements
9 December 2014
0 references
linearly constrained convex programming
0 references
primal-infeasible interior point algorithm
0 references
polynomial complexity
0 references
0.862468957901001
0 references
0.8426792621612549
0 references
0.8418247699737549
0 references
