Network interior point bibliography: Preconditioners

  1. On the convergence of an inexact primal-dual interior point method for linear programming

    V. Baryamureeba and T. Steihaug

    Technical Report 188, Department of Informatics, University of Bergen, 2000.

  2. Spectral analysis of (sequences of) graph matrices

    A. Frangioni and S.S. Capizzano

    SIAM Journal on Matrix Analysis and Applications, 23(2):339-348, 2001.

  3. New preconditioners for KKT systems of network flow problems

    A. Frangioni and C. Gentile

    Technical Report 539, Istituto di Analisi dei Sistemi ed Informatica, 2000.

  4. ERRATA: A study of preconditioners for network interior point methods

    J.J. Júdice, J.M. Patrício, L.F. Portugal, M.G.C. Resende, and G. Veiga

    Technical report, AT&T Labs Research, Florham Park, NJ 07932 USA, 2003.

  5. A study of preconditioners for network interior point methods

    J.J. Júdice, J.M. Patrício, L.F. Portugal, M.G.C. Resende, and G. Veiga

    Computational Optimization and Applications, 24:5-35, 2003.

  6. Uniform boundedness of a preconditioned normal matrix used in interior point methods

    R.D.C. Monteiro, J. W. O'Neal, and T. Tsuchiya

    Technical report, School of Industrial Engineering, Georgia Institute of Technology, 2003.

  7. Conjugate gradient based implementation of interior point methods for network flow problems

    S. Mehrotra and J. Wang

    In L. Adams and L. Nazareth, editors, Linear and Nonlinear Conjugate Gradient-Related Methods, pages 124-142. SIAM, 1996.

  8. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners

    P.M. Vaidya

    Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1990.

  9. The convergence of an interior-point method using modified search directions in final iterations

    W.C. Wang

    Computers & Mathematics with Applications, 44(3-4):347-356, 2002.

  10. Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming

    W. Wang and D.P. O'Leary

    Numerical Algorithms, 25(1-4):387-406, 2000.