On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method (Q3026741)
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 4014443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method |
scientific article; zbMATH DE number 4014443 |
Statements
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (English)
0 references
On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method (English)
0 references
1986
0 references
barrier function method
0 references
projected Newton search
0 references
Karamarkar's projective method
0 references
0 references
0 references
0 references
0.8603993058204651
0 references
0.8585339188575745
0 references
0.856424868106842
0 references
The barrier function method is applied to linear programming problems using a projected Newton search direction for the solution of subproblems. The relationship between the presented algorithm and Karamarkar's projective method is discussed. It turns out that if both of these methods are applied to the same problem using the same initial point, then by using special parameter values in the barrier method one can achieve that the iterates are identical. Algorithmic details are outlined and the performance on a standard as well as a degenerate test set is summarized. Conclusions pro and contra the barrier method are also discussed.
0 references