A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
Year of publication: |
1996
|
---|---|
Authors: | Todd, M.J. ; Ye, Y. |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 62.1996, p. 233-252
|
Saved in:
Saved in favorites
Similar items by person
-
Efficient Acceleration Techniques for Fixed Point Algorithms
Saigal, R., (1976)
-
Efficient acceleration techniques for fixed point algorithms
SAIGAL, R.,
-
Erratum: Probabilistic Models for Linear Programming
Todd, M.J., (1998)
- More ...