Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming (Q6408204)
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: Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming |
scientific article; zbMATH DE number 900543598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming |
scientific article; zbMATH DE number 900543598 |
Statements
18 August 2022
0 references
math.OC
0 references
