An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02206810 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000930544 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 30 July 2024
scientific article
| 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 |
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
