Volumetric path following algorithms for linear programming-Reference-Cited by-同舟云学术

Volumetric path following algorithms for linear programming

Published:1997-01 Issue:1 Volume:76 Page:245-263
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Anstreicher Kurt M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference11 articles.

1. K.M. Anstreicher, “Large step volumetric potential reduction algorithms for linear programming,”Annals of O.R. 62 (1996) 521–538.

2. D. den Hertog, “Interior point approach to linear, quadratic, and convex programming,” Ph.D. Thesis, Delft University of Technology, Delft, Netherlands (1992).

3. D. den Hertog, C. Roos and T. Terlaky, “On the monotonicity of the dual objective along barrier paths,”COAL Bulletin 20 (1992) 2–7.

4. C.C. Gonzaga, “Path following methods for linear programming,”SIAM Review 34 (1992) 167–224.

5. R.A. Horn and C.R. Johnson,Matrix Analysis (Cambridge University Press, Cambridge, 1985).

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

1. Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

2. Solving tall dense linear programs in nearly linear time;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

3. Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization;IEEE Access;2020

4. Equilibria and Weighted Complementarity Problems;Numerical Analysis and Optimization;2018

5. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow;2014 IEEE 55th Annual Symposium on Foundations of Computer Science;2014-10