A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548)
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 4118154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple complexity proof for a polynomial-time linear programming algorithm |
scientific article; zbMATH DE number 4118154 |
Statements
A simple complexity proof for a polynomial-time linear programming algorithm (English)
0 references
1989
0 references
A variant of Karmarkar's polynomial-time algorithm for linear programming is given. A logarithmic penalty function is attached to the objective function and the resulting nonlinear problem is solved by using a sequence of quadratic approximations. There is a simple proof of complexity of \(O(m^{1/2}L)\) iterations and \(O(m^{3,5}L)\) arithmetic operations, where m is the number of variables and L is the size of the problem encoded in binary.
0 references
Karmarkar's polynomial-time algorithm
0 references
logarithmic penalty function
0 references
quadratic approximations
0 references
0 references
0.8634147644042969
0 references
