On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators

In this paper, we study a class of generalized monotone variational inequality (GMVI) problems whose operators are not necessarily monotone (e.g., pseudo-monotone). We present non-Euclidean extragradient (N-EG) methods for computing an approximate strong solution of these problems, and demonstrate how their iteration complexities depend on the global Lipschitz or H\”{o}lder continuity properties for their operators … Read more

The Split Common Null Point Problem

We introduce and study the Split Common Null Point Problem (SCNPP) for set-valued maximal monotone mappings in Hilbert spaces. This problem generalizes our Split Variational Inequality Problem (SVIP) [Y. Censor, A. Gibali and S. Reich, Algorithms for the split variational inequality problem, Numerical Algorithms 59 (2012), 301–323]. The SCNPP with only two set-valued mappings entails … Read more

A class of Fejer convergent algorithms, approximate resolvents and the Hybrid Proximal-Extragradient method

A new framework for analyzing Fejer convergent algorithms is presented. Using this framework we define a very general class of Fejer convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents which preserve some useful features of the exact resolvent, and use this concept to present an unifying … Read more

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS

In the context of mixed complementarity problems, various concepts of solution regularity are known, each of them playing a certain role in related theoretical and algorithmic developments. In this note, we provide the complete picture of relations between the most important regularity conditions for mixed complementarity problems. A special attention is paid to the particular … Read more

A von Neumann Alternating Method for Finding Common Solutions to Variational Inequalities

Modifying von Neumann’s alternating projections algorithm, we obtain an alternating method for solving the recently introduced Common Solutions to Variational Inequalities Problem (CSVIP). For simplicity, we mainly confine our attention to the two-set CSVIP, which entails finding common solutions to two unrelated variational inequalities in Hilbert space. Citation Nonlinear Analysis Series A: Theory, Methods & … Read more

Algorithms for Bilevel Pseudomonotone Variational Inequality Problems

We propose easily implementable algorithms for minimizing the norm with pseudomonotone variational inequality constraints. This bilevel problem arises in the Tikhonov regularization method for pseudomonone variational inequalities. Since the solution set of the lower variational inequality is not given explicitly, the available methods of mathematical programming and variational inequality can not be applied directly. With … Read more

A lifting method for generalized semi-infinite programs based on lower level Wolfe duality

This paper introduces novel numerical solution strategies for generalized semi-infinite optimization problems (GSIP), a class of mathematical optimization problems which occur naturally in the context of design centering problems, robust optimization problems, and many fields of engineering science. GSIPs can be regarded as bilevel optimization problems, where a parametric lower-level maximization problem has to be … Read more

A Family of Newton Methods for Nonsmooth Constrained Systems with Nonisolated Solutions

We propose a new family of Newton-type methods for the solution of constrained systems of equations. Under suitable conditions, that do not include differentiability or local uniqueness of solutions, local, quadratic convergence to a solution of the system of equations can be established. We show that as particular instances of the method we obtain inexact … Read more

A Class of Dantzig-Wolfe Type Decomposition Methods for Variational Inequality Problems

We consider a class of decomposition methods for variational inequalities, which is related to the classical Dantzig–Wolfe decomposition of linear programs. Our approach is rather general, in that it can be used with set-valued or nonmonotone operators, as well as various kinds of approximations in the subproblems of the functions and derivatives in the single-valued … Read more

An LP-Newton Method: Nonsmooth Equations, KKT Systems, and Nonisolated Solutions

We define a new Newton-type method for the solution of constrained systems of equations and analyze in detail its properties. Under suitable conditions, that do not include differentiability or local uniqueness of solutions, the method converges locally quadratically to a solution of the system of equations, thus filling an important gap in the existing theory. … Read more