A New Decomposition Method for Variational Inequalities with Linear Constraints

We propose a new decomposition method for solving a class of monotone variational inequalities with linear constraints. The proposed method needs only to solve a well-conditioned system of nonlinear equations, which is much easier than a variational inequality, the subproblem in the classic alternating direction methods. To make the method more flexible and practical, we solve the sub-problems approximately. We adopt a self-adaptive rule to adjust the parameter, which can improve the numerical performance of the algorithm. Under mild conditions, the underlying mapping be monotone and the solution set of the problem be nonempty, we prove the global convergence of the proposed algorithm. Finally, we report some preliminary computational results, which demonstrate the promising performance of the new algorithm.

[1]  Bingsheng He,et al.  Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities , 1998, Oper. Res. Lett..

[2]  Masao Fukushima,et al.  A globally convergent Newton method for solving strongly monotone variational inequalities , 1993, Math. Program..

[3]  L. Liao,et al.  Improvements of Some Projection Methods for Monotone Nonlinear Variational Inequalities , 2002 .

[4]  Hai Yang,et al.  Solving a Class of Asymmetric Variational Inequalities by a New Alternating Direction Method , 2000 .

[5]  D. Gabay.  Applications of the method of multipliers to variational inequalities , 1983 .

[6]  Deren Han,et al.  Solving Variational Inequality Problems with Linear Constraints by a Proximal Decomposition Algorithm , 2004, J. Glob. Optim..

[7]  R. Glowinski.  Lectures on Numerical Methods for Non-Linear Variational Problems , 1981 .

[8]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[9]  Deren Han,et al.  Inexact Operator Splitting Methods with Selfadaptive Strategy for Variational Inequality Problems , 2007 .

[10]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[11]  Jonathan Eckstein.  Some Saddle-function splitting methods for convex programming , 1994 .

[12]  Bin-Xin He.  Solving a class of linear projection equations , 1994 .

[13]  Hong K. Lo,et al.  A new stepsize rule in He and Zhou's alternating direction method , 2002, Appl. Math. Lett..

[14]  Bingsheng He,et al.  A modified alternating direction method for convex minimization problems , 2000, Appl. Math. Lett..

[15]  Deren Han,et al.  A proximal decomposition algorithm for variational inequality problems , 2003 .

[16]  Robert R. Meyer,et al.  A variable-penalty alternating directions method for convex optimization , 1998, Math. Program..

[17]  Anna Nagurney,et al.  Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions , 1996, Transp. Sci..

[18]  R. Glowinski,et al.  Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics , 1987 .

[19]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[20]  Marc Teboulle,et al.  A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..

[21]  W. Hager,et al.  Large Scale Optimization : State of the Art , 1993 .

[22]  B. He.  A class of projection and contraction methods for monotone variational inequalities , 1997 .

[23]  Hai Yang,et al.  Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities , 2002 .

[24]  Bingsheng He,et al.  Self-adaptive operator splitting methods for monotone variational inequalities , 2003, Numerische Mathematik.

[25]  T. Zhu,et al.  A simple proof for some important properties of the projection mapping , 2004 .

[26]  H. K. Lo,et al.  New Alternating Direction Method for a Class of Nonlinear Variational Inequality Problems , 2002 .

[27]  Paul Tseng,et al.  Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities , 1997, SIAM J. Optim..

[28]  Wei Xu,et al.  An operator splitting method for variational inequalities with partially unknown mappings , 2008, Numerische Mathematik.

[29]  Bingsheng He,et al.  A new method for a class of linear variational inequalities , 1994, Math. Program..

[30]  Deren Han,et al.  A Modified Alternating Direction Method for Variational Inequality Problems , 2002 .

[31]  Deren Han,et al.  Self-Adaptive Implicit Methods for Monotone Variant Variational Inequalities , 2009 .

[32]  Deren Han,et al.  A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems , 2008, Comput. Math. Appl..

[33]  Masao Fukushima,et al.  Application of the alternating direction method of multipliers to separable convex programming problems , 1992, Comput. Optim. Appl..

[34]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[35]  M. Fortin,et al.  Augmented Lagrangian methods : applications to the numerical solution of boundary-value problems , 1983 .

[36]  Masao Fukushima,et al.  Some Reformulations and Applications of the Alternating Direction Method of Multipliers , 1994 .

[37]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[38]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[39]  Ernie Esser,et al.  Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman , 2009 .