An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities

The augmented Lagrangian method is attractive in constraint optimizations. When it is applied to a class of constrained variational inequalities, the sub-problem in each iteration is a nonlinear complementarity problem (NCP). By introducing a logarithmic-quadratic proximal term, the sub-NCP becomes a system of nonlinear equations, which we call the LQP system. Solving a system of nonlinear equations is easier than the related NCP, because the solution of the NCP has combinatorial properties. In this paper, we present an inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities, in which the LQP system is solved approximately under a rather relaxed inexactness criterion. The generated sequence is Fejér monotone and the global convergence is proved. Finally, some numerical test results for traffic equilibrium problems are presented to demonstrate the efficiency of the method.      

Multi-valued variational inequalities with K-pseudomonotone operators

In this paper, we first employ the 1961 celebrated Fan lemma to derive a very general existence result for multi-valued variational inequalities involving multi-valued K-pseudomonotone operators. It will be seen that this result improves and unifies existence results of variational inequalities for monotone operators. Next, we establish some uniqueness results for multi-valued variational inequalities by introducing the concepts of strict, , and strong K-pseudomonotonicity of multi-valued operators, respectively. These uniqueness results appear to be new even if the underlying space is finite-dimensional.This work was partially supported by the National Science Council Grant NSC 82-0208-M-110-023. The author would like to express his sincere thanks to the referees for their valuable comments and suggestions that improved this paper substantially.     

Descent method with inexact linesearch for mixed variational inequalities

We propose a descent method with respect to a merit function for the mixed variational inequality involving a general nonlinear mapping and a convex, but not necessarily differentiable function. The method utilizes an inexact linesearch procedure. Its convergence is proved under the additional assumptions of continuity and strong monotonicity of the cost mapping.     

On a class of variational inequalities

In this paper, we introduce and study a new unified and general class of variational inequalities. We derive the general error estimates for the finite element solutions of variational inequalities. It has been shown that a class of contact problems with friction terms arising in elastostatics can be studied in the framework of variational inequalities. Several special cases, which can be obtained from the general results, are also discussed.     

An inexact implicit method for general mixed variational inequalities

In the present paper, we present an inexact implicit method with a variable parameter for general mixed variational inequalities. We use a self-adaptive technique to adjust parameter ρ$\rho$ at each iteration. The main advantage of this technique is that the method can adjust the parameter automatically and the numbers of iteration are not very sensitive to different initial parameter _ρ0.${\rho }_0.$     

On a class of quasi variational inequalities

In this paper, we introduce and study a new class of quasi variational inequalities. Using essentially the projection technique and its variant forms, we establish the equivalence between generalized nonlinear quasi variational inequalities and the fixed point problems. This equivalence is then used to suggest and analyze a number of new iterative algorithms. These new results include the corresponding known results for generalized quasi variational inequalities as special cases.     

Spectral problems for variational inequalities with discontinuous operators

Some spectral problems for variational inequalities with discontinuous nonlinear operators are considered. The variational method is used to prove the assumption that such problems are solvable. The general results are applied to the corresponding elliptic variational inequalities with discontinuous nonlinearities.     

Noncoercive variational inequalities for pseudomonotone operators

Compatibility conditions for noncoercive variational inequalities are given together with applications to quasi-linear systems of elliptic equations, elliptic variational inequalities with convection terms, closedness of algebraic difference of convex sets and lower semicontinuity of the infimal-convolution. Si provano alcune condizioni di compatibilità astratte per disequazioni variazionali noncoercive. Se ne deducono: risultati di esistenza per sistemi quasi-lineari di equazioni ellittiche e disequazioni variazionali con termini di trasporto, criteri di chiusura della differenza algebrica di convessi in spazi di Banach, e di semicontinuità per la inf-convoluzione di funzionali.

---

(Conferenza tenuta il 4 febbraio 1992)     

On solvability of variational inequalities with discontinuous semimonotone operators

By using the method of monotone operators, a theorem on the existence of the solution with a special property is obtained for an elliptic variational inequality with discontinuous semimonotone operator; this theorem is then used to prove the existence of a semicorrect solution of a variational inequality with a differential semilinear high-order operator of elliptic type with a nonsymmetric linear part and discontinuous nonlinearity.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 3, pp. 443–447, March, 1993.     

New inexact implicit method for general mixed quasi variational inequalities

In this paper, we suggest and analyze a new self-adaptive inexact implicit method with a variable parameter for general mixed quasi variational inequalities, where the skew-symmetry of the nonlinear bifunction plays a crucial part in the convergence analysis of this method. We use a self-adaptive technique to adjust parameter ρ at each iteration. The global convergence of the proposed method is proved under some mild conditions. Preliminary numerical results indicate that the self-adaptive adjustment rule is necessary in practice. Muhammad Aslam Noor is supported by the Higher Education Commission, Pakistan, through research grant No: 1-28/HEC/HRD/2005/90.     

On a class of scalar variational inequalities with measure data

We consider a class of variational inequalities defining the so-called hysteresis play operator. We propose a new approach to discontinuous BV-solutions based on measure theoretical arguments, which enable us to infer the existence of solutions as a simple consequence of the classical theory. In this way, we generalize a recent result where only continuous BV-solutions were studied. We also provide a representation formula which allows to deduce the continuity of the play operator from general theorems on hysteresis operators.     

A modified inexact operator splitting method for monotone variational inequalities

The Douglas–Peaceman–Rachford–Varga operator splitting methods (DPRV methods) are attractive methods for monotone variational inequalities. He et al. [Numer. Math. 94, 715–737 (2003)] proposed an inexact self-adaptive operator splitting method based on DPRV. This paper relaxes the inexactness restriction further. And numerical experiments indicate the improvement of this relaxation.      

Generalized vector variational inequalities with star-pseudomonotone and discontinuous operators

It is well known that a vector variational inequality can be a very efficient model for use in studying vector optimization problems. By using the Ky Fan fixed point theorem and the scalarization method we will prove some existence theorems for strong solutions for generalized vector variational inequalities where discontinuous and star-pseudomonotone operators are involved. Our results can be applied to the study of the existence of solutions of vector optimal problems. Some examples are given and analyzed.     

Accelerated schemes for a class of variational inequalities

We propose a novel stochastic method, namely the stochastic accelerated mirror-prox (SAMP) method, for solving a class of monotone stochastic variational inequalities (SVI). The main idea of the proposed algorithm is to incorporate a multi-step acceleration scheme into the stochastic mirror-prox method. The developed SAMP method computes weak solutions with the optimal iteration complexity for SVIs. In particular, if the operator in SVI consists of the stochastic gradient of a smooth function, the iteration complexity of the SAMP method can be accelerated in terms of their dependence on the Lipschitz constant of the smooth function. For SVIs with bounded feasible sets, the bound of the iteration complexity of the SAMP method depends on the diameter of the feasible set. For unbounded SVIs, we adopt the modified gap function introduced by Monteiro and Svaiter for solving monotone inclusion, and show that the iteration complexity of the SAMP method depends on the distance from the initial point to the set of strong solutions. It is worth noting that our study also significantly improves a few existing complexity results for solving deterministic variational inequality problems. We demonstrate the advantages of the SAMP method over some existing algorithms through our preliminary numerical experiments.     

Benders decomposition for a class of variational inequalities

This paper examines Benders decomposition for a useful class of variational inequality (VI) problems that can model, e.g., economic equilibrium, games or traffic equilibrium. The dual of the given VI is defined. Benders decomposition of the original VI is derived by applying a Dantzig–Wolfe decomposition procedure to the dual of the given VI, and converting the dual forms of the Dantzig–Wolfe master and subproblems to their primal forms. The master problem VI includes a new cut at each iteration, with information from the latest subproblem VI, which is solved by fixing the “difficult” variables at values determined by the previous master problem. A scalar parameter called the convergence gap is calculated at each iteration; a negative value is equivalent to the algorithm making progress in that the last master problem solution is made infeasible by the new cut. Under mild conditions, the convergence gap approaches zero in the limit of many iterations. With a more restrictive condition that still admits many useful models, a zero value of the convergence gap implies that the master problem has found a solution of the VI. A small model of competitive equilibrium of three commodities in two regions serves as an illustration.     

Solving variational inequalities defined on a domain with infinitely many linear constraints

We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. A discretization method and an analytic center based inexact cutting plane method are proposed. Under proper assumptions, the convergence results for both methods are given. We also provide numerical examples to illustrate the proposed methods. The work of S. Wu was partially supported by the National Science Council, Taiwan, ROC (Grant No. 19731001). S.-C. Fang’s research has been supported by the US Army Research Office (Grant No. W911NF-04-D-0003) and National Science Foundation (Grant No. DMI-0553310).     

Solving variational inequalities by a modified projection method with an effective step-size

In this paper, we propose a new projection method for the solution of variational inequality problems. The method is simple, which uses only function evaluations and projections onto the feasible set. We adopt a new step-size rule and a new search direction in the new method. Under the mild conditions, we prove the proposed method is globally convergent. Preliminary numerical results are reported.