Skip to main content
SpringerLink
Log in

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

This paper presents an infeasible-interior-point algorithm for a class of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Andersen, E. D., Ye, Y., On homogeneous algorithm for the monotone complementarity problem, Mathematical Programming, 1999, 84(2): 375.

    Article  MATH  MathSciNet  Google Scholar 

  2. Wright, S., Ralph, D., A supperlinear infeasible-interior-point algorithm for monotone complementarity problems, Mathematics of Operations Research, 1996, 24(4): 815.

    Article  MathSciNet  Google Scholar 

  3. Kojima, M., Noma, T., Yoshise, A., Global convergence in infeasible-interior-point algorithms, Mathematical Programming, 1994, 65(1): 43.

    Article  MathSciNet  Google Scholar 

  4. Kojima, M., Megiddo, N., Noma, T., A new continuation method for complementarity problems with uniform p-functions, Mathematical Programming, 1989, 43(l): 107.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kojima, M., Megiddo, N., Mizuno, S., A general framework of continuation method for complementarity problems, Mathematics of Operations Research, 1993, 18(4): 945.

    MATH  MathSciNet  Google Scholar 

  6. More, J., Rheinboldt, W., On P- and S-functions and related classes of n-dimensional nonlinear mappings, Linear Algebra and Its Applications, 1973, 6(1): 45.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Scientific Computing, Science School, Xi’an Jiaotong University, 710049, Xi’an, China

    Shanglu He & Chengxian Xu

Authors
  1. Shanglu He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chengxian Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, S., Xu, C. Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity. Sci. China Ser. A-Math. 44, 338–344 (2001). https://doi.org/10.1007/BF02878714

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02878714

Keywords

Search

Navigation