Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738)
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: Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO |
scientific article; zbMATH DE number 6495737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO |
scientific article; zbMATH DE number 6495737 |
Statements
Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (English)
0 references
19 October 2015
0 references
linearly constrained convex optimization
0 references
interior point methods
0 references
short-step primal-dual algorithms
0 references
complexity of algorithms
0 references
0.8798561692237854
0 references
0.7896561622619629
0 references
0.7781676054000854
0 references
0.774810791015625
0 references
