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

Authors:
Jinbao Jian
Affiliations:
-
Venue:
Journal of Global Optimization
Year:
1999

Citing 5
Cited 1

A relaxed projection method for variational inequalities

Mathematical Programming: Series A and B
Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications

Mathematical Programming: Series A and B
A globally convergent Newton method for solving strongly monotone variational inequalities

Mathematical Programming: Series A and B
A continuation method for monotone variational inequalities

Mathematical Programming: Series A and B
A continuation method for (strongly) monotone variational inequalities

Mathematical Programming: Series A and B

Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.