A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (Q1383829)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1139624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constant-potential infeasible-start interior-point algorithm with computational experiments and applications |
scientific article; zbMATH DE number 1139624 |
Statements
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (English)
0 references
13 April 1998
0 references
potential function
0 references
polynomial complexity
0 references
constant-potential infeasible-start interior-point
0 references
worst-case iteration complexity analysis
0 references
simple recourse
0 references
large scale planning
0 references
0.8245531320571899
0 references
0.7965925335884094
0 references
0.781487226486206
0 references
