Implementing cholesky factorization for interior point methods of linear programming-Reference-Cited by-同舟云学术

Implementing cholesky factorization for interior point methods of linear programming

Published:1993-01 Issue:1-2 Volume:27 Page:121-140
ISSN:0233-1934
Container-title:Optimization
language:en
Short-container-title:Optimization

Author:

Gondzio J.¹

Affiliation:

1. a Polish Academy of Sciences , Systems Research Institute , Newelska 6, Warsaw , 01-447 , Poland

Publisher

Informa UK Limited

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

https://www.tandfonline.com/doi/pdf/10.1080/02331939308843876

Reference30 articles.

1. An implementation of Karmarkar's algorithm for linear programming

2. Altman A. Gondzio J. 1992a An efficient implementation of a higher order primal-dual interior point method for large sparse linear programs Technical Report ZTSW-l/A214/92, Systems Research Institute, Polish Academy of Sciences, Warsaw, June 1992, revised in September 1992, to appear in: Archives of Control Sciences

3. On the augmented system approach to sparse least-squares problems

4. A comparison of three algorithms for reducing the profile of a sparse matrix

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

1. An interior-point implementation developed and tuned for radiation therapy treatment planning;Computational Optimization and Applications;2017-06-28

2. Interior-Point Linear Programming Solvers;Wiley Encyclopedia of Operations Research and Management Science;2011-01-14

3. A proximal subgradient projection algorithm for linearly constrained strictly convex problems;Optimization Methods and Software;2007-08

4. Implementing a proximal algorithm for some nonlinear multicommodity flow problems;Networks;2006

5. GPM ANALYSIS IN COMBINING INTERIOR POINTS AND THE SIMPLEX METHOD;Journal of the Chinese Institute of Industrial Engineers;2002-01