PDNET

A truncated primal-infeasible dual-feasible network interior point method The authors introduce the truncated primal-infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum-cost network flow problem. In each iteration, the linear system that determines the search direction is computed inexactly, and the norm of the resulting residual vector is used in the stopping criteria of the iterative solver employed for the solution of the system. In the implementation, a preconditioned conjugate gradient method is used as the iterative solver. The details of the implementation are described and the code PDNET is tested on a large set of standard minimum-cost network flow test problems. Computational results indicate that the implementation is competitive with state-of-the-art network flow codes.


References in zbMATH (referenced in 34 articles , 1 standard article )

Showing results 1 to 20 of 34.
Sorted by year (citations)

1 2 next

  1. Dell’Acqua, Pietro; Frangioni, Antonio; Serra-Capizzano, Stefano: Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (2015)
  2. Dražić, Milan D.; Lazović, Rade P.; Kovačević-Vujčić, Vera V.: Sparsity preserving preconditioners for linear systems in interior-point methods (2015)
  3. Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)
  4. Andreani, Roberto; Júdice, Joaquim J.; Martínez, José Mario; Patrício, Joao: A projected-gradient interior-point algorithm for complementarity problems (2011)
  5. Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; Johnson, Ellis L.; Sokol, Joel S.: A least-squares minimum-cost network flow algorithm (2011)
  6. Velazco, M.I.; Oliveira, A.R.L.; Campos, F.F.: A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods (2010)
  7. Avron, Haim; Chen, Doron; Shklarski, Gil; Toledo, Sivan: Combinatorial preconditioners for scalar elliptic finite-element problems (2009)
  8. Lu, Zhaosong; Monteiro, Renato D.C.; O’Neal, Jerome W.: An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (2009)
  9. Portugal, L.F.; Resende, M.G.C.; Veiga, G.; Patrício, J.; Júdice, J.J.: Fortran subroutines for network flow optimization using an interior point algorithm (2008)
  10. Bocanegra, S.; Campos, F.F.; Oliveira, A.R.L.: Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (2007)
  11. Cafieri, S.; D’Apuzzo, M.; De Simone, V.; di Serafino, D.; Toraldo, G.: Convergence analysis of an inexact potential reduction method for convex quadratic programming (2007)
  12. Frangioni, A.; Gentile, C.: Prim-based support-graph preconditioners for min-cost flow problems (2007)
  13. Frangioni, Antonio; Gentile, Claudio: Experiments with a hybrid interior point/combinatorial approach for network flow problems (2007)
  14. Baryamureeba, Venansius; Steihaug, Trond: On the convergence of an inexact primal-dual interior point method for linear programming (2006)
  15. Lu, Zhaosong; Monteiro, Renato D.C.; O’Neal, Jerome W.: An iterative solver-based infeasible primal-dual path-following algorithm for convex quadratic programming (2006)
  16. Mitchell, John E.; Farwell, Kris; Ramsden, Daryn: Interior point methods for large-scale linear programming (2006)
  17. Mehrotra, Sanjay; Li, Zhifeng: Convergence conditions and Krylov subspace-based corrections for primal-dual interior-point method (2005)
  18. Bellavia, Stefania; Pieraccini, Sandra: Convergence analysis of an inexact infeasible interior point method for semidefinite programming (2004)
  19. Frangioni, A.; Gentile, C.: New preconditioners for KKT systems of network flow problems (2004)
  20. Júdice, Joaquim J.; Patricio, João; Portugal, Luis F.; Resende, Mauricio G. C.; Veiga, Geraldo: A study of preconditioners for network interior point methods (2003)

1 2 next