A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419)
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 513282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual infeasible-interior-point algorithm for linear programming |
scientific article; zbMATH DE number 513282 |
Statements
A primal-dual infeasible-interior-point algorithm for linear programming (English)
0 references
10 March 1994
0 references
A so-called `primal-dual infeasible-interior-point algorithm' is proposed for solving linear programming problems. As usual, it takes a new point along the Newton direction at each step; however, the point taken will not be necessarily within the feasible region although within the interior of the region determined by the nonnegative constraints. So one can start from an arbitrary primal-dual pair of points with strictly positive components. A step length rule is used to ensure the global convergence of the algorithm.
0 references
primal-dual infeasible-interior-point algorithm
0 references
step length rule
0 references
global convergence
0 references
0 references
0 references
0 references
0.862468957901001
0 references
0.8546491265296936
0 references
0.8537580370903015
0 references
0.8537089824676514
0 references
