Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1609.00694 / rank | |||
Normal rank | |||
Revision as of 00:30, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming |
scientific article |
Statements
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (English)
0 references
29 October 2018
0 references
polynomial algorithm
0 references
arc-search
0 references
infeasible interior-point method
0 references
linear programming
0 references
