On the finite convergence of interior-point algorithms for linear programming-Reference-Cited by-同舟云学术

On the finite convergence of interior-point algorithms for linear programming

Published:1992-05 Issue:1-3 Volume:57 Page:325-335
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Ye Yinyu

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference30 articles.

1. I. Adler and R.C. Monteiro, “A geometric view of parametric linear programming,” manuscript, Department of IEOR, University of California (Berkeley, CA, 1989).

2. K.M. Anstreicher, “Dual ellipsoids and degeneracy in the projective algorithm for linear programming,”Contemporary Mathematics 114 (1991) 141–150.

3. G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).

4. Numerical Analysis Manuscript;D.M. Gay,1989

5. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, “On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,”Mathematical Programming 36 (1986) 183–209.

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

1. On the geometry and refined rate of primal–dual hybrid gradient for linear programming;Mathematical Programming;2024-07-17

2. A Primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils;Journal of Industrial & Management Optimization;2021

3. A quantum interior-point predictor–corrector algorithm for linear programming;Journal of Physics A: Mathematical and Theoretical;2020-10-15

4. Towards an efficient augmented Lagrangian method for convex quadratic programming;Computational Optimization and Applications;2019-12-16

5. On the identification of the optimal partition for semidefinite optimization;INFOR: Information Systems and Operational Research;2019-03-05