An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635)
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: An interior point parameterized central path following algorithm for linearly constrained convex programming |
scientific article; zbMATH DE number 7488708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior point parameterized central path following algorithm for linearly constrained convex programming |
scientific article; zbMATH DE number 7488708 |
Statements
An interior point parameterized central path following algorithm for linearly constrained convex programming (English)
0 references
14 March 2022
0 references
interior point method
0 references
path following
0 references
polynomial-time complexity
0 references
convex programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8459852933883667
0 references
0.8325947523117065
0 references
0.8294090032577515
0 references
0.8281822204589844
0 references
