Long steps in an O(n 3 L) algorithm for linear programming-Reference-Cited by-同舟云学术

Long steps in an O(n 3 L) algorithm for linear programming

Published:1992-02 Issue:1-3 Volume:54 Page:251-265
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Anstreicher Kurt M.,Bosch Robert A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01586053.pdf

Reference26 articles.

1. K.M. Anstreicher, “A monotonic projective algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498.

2. K.M. Anstreicher, “A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm,”Mathematical Programming 47 (1990) 337–351.

3. E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.

4. E.R. Barnes, S. Chopra and D. Jensen, “A polynomial-time version of the affine scaling algorithm,” IBM Watson Research Center (Yorktown Heights, NY, 1988).

5. D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming,”American Mathematical Society 314 (1989) 499–581.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bibliography;Interior Point Algorithms;2011-10-14

2. All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings;SIAM Journal on Computing;1998-08

3. An interior point method, based on rank-1 updates, for linear programming;Mathematical Programming;1998-03

4. On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP;SIAM Journal on Optimization;1996-11

5. An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods;SIAM Journal on Optimization;1996-08