A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925)
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 new primal-dual path-following interior-point algorithm for linearly constrained convex optimization |
scientific article; zbMATH DE number 5630357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization |
scientific article; zbMATH DE number 5630357 |
Statements
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (English)
0 references
11 November 2009
0 references
linearly constrained convex optimization
0 references
interior-point algorithm
0 references
small-update method
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0.8798561692237854
0 references
0.8267289400100708
0 references
0.8258068561553955
0 references
0.8176077604293823
0 references
0.8140829205513
0 references
