A unified approach to interior point algorithms for linear complementarity problems: A summary

https://doi.org/10.1016/0167-6377(91)90010-MGet rights and content

Abstract

This note summarizes a report with the same title, where a study was carried out regarding a unified approach, proposed by Kojima, Mizuno and Yoshise, for interior point algorithms for the linear complementarily problem with a positive semi-definite matrix. This approach is extended to nonsymmetric matrices with nonnegative principal minors.

References (27)

  • R.W. Cottle et al.

    Sufficient matrices and the linear complementarity problem

    Linear Algebra Appl.

    (1989)
  • E.R. Barnes

    A variation on Karmarkar's algorithm for solving linear programming problems

    Math. Programming

    (1986)
  • E.R. Barnes et al.

    A polynomial time version of the affine algorithm

  • S.J. Chung

    A note on the complexity of the LCP: The LCP is strongly NP-complete

  • I.I. Dikin

    Iterative solution of problems of linear and quadratic programming

    Soviet Math. Dokl.

    (1967)
  • J. Ding et al.

    A polynomial-time predictor-corrector algorithm for linear complementarity problems

  • R.M. Freund

    Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

  • N. Karmarkar

    A new polynomial-time algorithm for linear programming

    Combinatorica

    (1984)
  • M. Kojima, N. Megiddo and T. Noma, “Homotopy continuation methods for nonlinear complementarity problems”, Math. Oper....
  • M. Kojima et al.

    A unified approach to interior point algorithms for linear complementarity problems

  • M. Kojima, N. Megiddo and Y. Ye, “An interior point potential reduction algorithm for the linear complementarity...
  • M. Kojima et al.

    A primal-dual interior point algorithm for linear programming

  • M. Kojima et al.

    A polynomial-time algorithm for a class of linear complementary problems

    Math. Programming

    (1989)
  • Cited by (21)

    View all citing articles on Scopus
    View full text