Weak sharp solutions for generalized variational inequalities

We consider weak sharp solutions for the generalized variational inequality problem, in which the underlying mapping is set-valued, and not necessarily monotone. We extend the concept of weak sharpness to this more general framework, and establish some of its characterizations. We establish connections between weak sharpness and (1) gap functions for variational inequalities, and (2) global error bound. When the solution set is weak sharp, we prove finite convergence of the sequence generated by an arbitrary algorithm, for the monotone set-valued case, as well as for the case in which the underlying set-valued map is either Lipschitz continuous in the set-valued sense, for infinite dimensional spaces, or inner-semicontinuous when the space is finite dimensional.     

Weak sharp solutions for variational inequalities in Banach spaces

In this paper, we introduce the notion of a weak sharp set of solutions to a variational inequality problem (VIP) in a reflexive, strictly convex and smooth Banach space, and present its several equivalent conditions. We also prove, under some continuity and monotonicity assumptions, that if any sequence generated by an algorithm for solving (VIP) converges to a weak sharp solution, then we can obtain solutions for (VIP) by solving a finite number of convex optimization subproblems with linear objective. Moreover, in order to characterize finite convergence of an iterative algorithm, we introduce the notion of a weak subsharp set of solutions to a variational inequality problem (VIP), which is more general than that of weak sharp solutions in Hilbert spaces. We establish a sufficient and necessary condition for the finite convergence of an algorithm for solving (VIP) which satisfies that the sequence generated by which converges to a weak subsharp solution of (VIP), and show that the proximal point algorithm satisfies this condition. As a consequence, we prove that the proximal point algorithm possesses finite convergence whenever the sequence generated by which converges to a weak subsharp solution of (VIP).     

Strong convergence theorems for variational inequalities and relatively weak nonexpansive mappings

In this paper, we introduce an iterative sequence for finding a common element of the set of fixed points of a relatively weak nonexpansive mapping and the set of solutions of a variational inequality in a Banach space. Our results extend and improve the recent ones announced by Li (J Math Anal Appl 295:115–126, 2004), Jianghua (J Math Anal Appl 337:1041–1047, 2008), and many others.     

Finite convergence of algorithms for nonlinear programs and variational inequalities

Algorithms for nonlinear programming and variational inequality problems are, in general, only guaranteed to converge in the limit to a Karush-Kuhn-Tucker point, in the case of nonlinear programs, or to a solution in the case of variational inequalities. In this paper, we derive sufficient conditions for nonlinear programs with convex feasible sets such that any convergent algorithm can be modified, by adding a convex subproblem with a linear objective function, to guarantee finite convergence in a generalized sense. When the feasible set is polyhedral, the subproblem is a linear program and finite convergence is obtained. Similar results are also developed for variational inequalities.The research of the first author was supported in part by the Office of Naval Research under Contract No. N00014-86-K-0173.The authors are indebted to Professors Olvi Mangasarian, Garth McCormick, Jong-Shi Pang, Hanif Sherali, and Hoang Tuy for helpful comments and suggestions and to two anonymous referees for constructive remarks and for bringing to their attention the results in Refs. 13 and 14.     

Weak sharp solutions of mixed variational inequalities in Banach spaces

In this paper, using the approximate duality mapping, we introduce the definition of weak sharpness of the solution set to a mixed variational inequality in Banach spaces. In terms of the primal gap function associated to the mixed variational inequality, we give several characterizations of the weak sharpness.     

Positive weak solutions of semilinear second order elliptic inequalities via variational inequalities

Existence, uniqueness and convergence of approximants of positive weak solutions for semilinear second order elliptic inequalities are obtained. The nonlinearities involved in these inequalities satisfy suitable upper or lower bound conditions or monotonicity conditions. The lower bound conditions are allowed to contain the critical Sobolev exponents. The methodology is to establish variational inequality principles for demicontinuous pseudo-contractive maps in Hilbert spaces by considering convergence of approximants and apply them to the corresponding variational inequalities arising from the semilinear second order elliptic inequalities. Examples on the existence, uniqueness and convergence of approximants of positive weak solutions of the semilinear second order elliptic inequalities are given.     

Strong convergence result for monotone variational inequalities

Our aim in this paper is to study strong convergence results for L-Lipschitz continuous monotone variational inequality but L is unknown using a combination of subgradient extra-gradient method and viscosity approximation method with adoption of Armijo-like step size rule in infinite dimensional real Hilbert spaces. Our results are obtained under mild conditions on the iterative parameters. We apply our result to nonlinear Hammerstein integral equations and finally provide some numerical experiments to illustrate our proposed algorithm.     

Finite difference scheme for variational inequalities

In this paper, we show that a class of variational inequalities related with odd-order obstacle problems can be characterized by a system of differential equations, which are solved using the finite difference scheme. The variational inequality formulation is used to discuss the uniqueness and existence of the solution of the obstacle problems.     

Moment inequalities and weak convergence for negatively associated sequences

A probability inequality for S_n and somepth moment (p⩾2) inequalities for |S_n| and max 1⩽k⩽n | S_k| are established. Here S_n is the partial sum of a negatively associated sequence. Based on these inequalities, a weak invariance principle for strictly stationary negatively associated sequences is proved under some general conditions. Project supported by the National Natural Science Foundation of China, the Doctoral Program Foundation of the State Education Commission of China and the High Eductional Natural Science Foundation of Guangdong Province.     

Numerical verification of solutions for variational inequalities

In this paper, we consider a numerical technique that enables us to verify the existence of solutions for variational inequalities. This technique is based on the infinite dimensional fixed point theorems and explicit error estimates for finite element approximations. Using the finite element approximations and explicit a priori error estimates for obstacle problems, we present an effective verification procedure that through numerical computation generates a set which includes the exact solution. Further, a numerical example for an obstacle problem is presented. Received October 28,1996 / Revised version received December 29,1997     

Existence theorems for solutions of variational inequalities

Summary The existence of nonzero solutions for a class of generalized variational inequalities is studied by fixed point index approach for multi-valued mappings in finite dimensional spaces and reflexive Banach spaces.     

Gap functions and error bounds for weak vector variational inequalities

In this article, by using the image space analysis, a gap function for weak vector variational inequalities is obtained. Its lower semicontinuity is also discussed. Then, these results are applied to obtain the error bounds for weak vector variational inequalities. These bounds provide effective estimated distances between a feasible point and the solution set of the weak vector variational inequalities.     

Sensitivity analysis for variational inequalities

Sensitivity analysis results for variational inequalities are presented which give conditions for existence and equations for calculating the derivatives of solution variables with respect to perturbation parameters. The perturbations are of both the variational inequality function and the feasible region. Results for the special case of nonlinear complementarity are also presented. A numerical example demonstrates the results for variational inequalities.The author is indebted to A. V. Fiacco for many valuable suggestions and comments. This work was supported in part by funding from the Economic Regulatory Administration, US Department of Energy, under Contract No. W31109ENG38.     

求解单调变分不等式的近似邻近点算法的收敛性分析

为了求解单调变分不等式,建立了一个新的误差准则,并且在不需要增加诸如投影,外梯度等步骤的情况下证明了邻近点算法的收敛性.     

On the convergence of a regularization method for variational inequalities

For variational inequalities in a finite-dimensional space, the convergence of a regularization method is examined in the case of a nonmonotone basic mapping. It is shown that a fairly general sufficient condition for the existence of solutions to the original problem also guarantees the convergence and existence of solutions to perturbed problems. Examples of applications to problems on order intervals are presented.