Skip to main content
Log in

A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we discuss the variational inequality problems VIP(X, F), where F is a strongly monotone function and the convex feasible set X is described by some inequaliy constraints. We present a continuation method for VIP(X, F), which solves a sequence of perturbed variational inequality problems PVIP(X, F, ε, μ) depending on two parameters ε ≥ 0 and μ>0. It is worthy to point out that the method will be a feasible point type when ε=0 and an infeasible point type when ε>0, i.e., it is a combined feasible–infeasible point (CFIFP for short) method. We analyse the existence, uniqueness and continuity of the solution to PVIP(X, F, ε, μ), and prove that any sequence generated by this method converges to the unique solution of VIP(X, F). Moreover, some numerical results of the algorithm are reported which show the algorithm is effective.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Harker, P.T. (1993) Lectures on computation of equilibria with equation-based methods, CORE Lecture Series, CORE Fundation, University Catholique de Louvain, Louvain-la-Neuve, Belgium.

  2. Harker, P.T. and Pang, J.S. (1990) Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithm and applications, Mathematical Programming 48: 161–220.

    Google Scholar 

  3. Kanzow, C. and Jiang, H. (1998) A continuation method for (Strongly) monotone variational inequalities, Mathematical Programming 81: 103–126.

    Google Scholar 

  4. Chen, B. and Harker, P.T. (1996) A continuation method for monotone variational inequalities, Mathematical Programming 69: 237–253.

    Google Scholar 

  5. Jian, J.B. (1997) A combined feasible-nonfeasible point continuation algorithm for monotone variational inequalities, OR Transaction 1 (China): 76–85.

  6. Bazaraa, M.S. and Shety, C.M. (1979) Nonlinear Programming: Theory and Algorithms,Wiley & Sons, New York.

    Google Scholar 

  7. Fukushima, M. (1986) A relaxed projection method for variational inequalities, Mathmatical Programming 35: 58–70.

    Google Scholar 

  8. Marcotte, P. and Dussault, J.P. (1987) A note on a globally convergent Newton method for solving variational inequalities, Operation Research Letters 6: 35–42.

    Google Scholar 

  9. Taji, K., Fukushima, M. and Ibaraki, T. (1993) A globally convergent Newton method for solving strongly monotone variational inequalities, Mathematical Programming 58: 369–383.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jian, J. A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems. Journal of Global Optimization 15, 197–211 (1999). https://doi.org/10.1023/A:1008331019912

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008331019912

Navigation