An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904)
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 infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
scientific article; zbMATH DE number 894977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution |
scientific article; zbMATH DE number 894977 |
Statements
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (English)
0 references
24 October 1996
0 references
interior-point
0 references
barrier function
0 references
Newton method
0 references
measures of infeasibility
0 references
nonoptimality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
