Given a semialgebraic set-valued map $F \colon \mathbb{R}^n \rightrightarrows \mathbb{R}^m$ with closed graph, we show that the map $F$ is Holder metrically subregular and that the following conditions are equivalent: (i) $F$ is an open map from its domain into its range and the range of $F$ is locally closed; (ii) the map $F$ is … Read more
We consider nested variational inequalities consisting in a (upper-level) variational inequality whose feasible set is given by the solution set of another (lower-level) variational inequality. Purely hierarchical convex bilevel optimization problems and certain multi-follower games are particular instances of nested variational inequalities. We present an explicit and ready-to-implement Tikhonov-type solution method for such problems. We … Read more
A global optimization approach for solving non-monotone equilibrium problems (EPs) is proposed. The class of (regularized) gap functions is used to reformulate any EP as a constrained global optimization program and some bounds on the Lipschitz constant of such functions are provided. The proposed global optimization approach is a combination of an improved version of … Read more
Mixed complementarity problems are of great importance in practice since they appear in various fields of applications like energy markets, optimal stopping, or traffic equilibrium problems. However, they are also very challenging due to their inherent, nonconvex structure. In addition, recent applications require the incorporation of integrality constraints. Since complementarity problems often model some kind … Read more
A hybrid projection-proximal point algorithm is proposed for variational inequality problems. Though the usual proximal point method and its variants require that the mapping involved be monotone, at least pseudomonotone, we assume only that the so-called Minty variational inequality has a solution, in order to ensure the global convergence. This assumption is less stringent than … Read more
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild conditions. Secondly, a classification of polynomial variational inequalities based on dimensions of their solution sets is introduced and … Read more
This paper studies a Nash game arising in portfolio optimization. We introduce a new general multi-portfolio model and state sufficient conditions for the monotonicity of the underlying Nash game. This property allows us to treat the problem numerically and, for the case of nonunique equilibria, to solve hierarchical problems of equilibrium selection. We also give … Read more
A real symmetric matrix “A” is copositive if the inner product if Ax and x is nonnegative for all x in the nonnegative orthant. Copositive programming has attracted a lot of attention since Burer showed that hard nonconvex problems can be formulated as completely-positive programs. Alas, the power of copositive programming is offset by its … Read more
It was recently found that the standard version of multi-block cyclic ADMM diverges. Interestingly, Gaussian Back Substitution ADMM (GBS-ADMM) and symmetric Gauss-Seidel ADMM (sGS-ADMM) do not have the divergence issue. Therefore, it seems that symmetrization can improve the performance of the classical cyclic order. In another recent work, cyclic CD (Coordinate Descent) was shown to … Read more
We study uncertain linear complementarity problems (LCPs), i.e., problems in which the LCP vector q or the LCP matrix M may contain uncertain parameters. To this end, we use the concept of Gamma-robust optimization applied to the gap function formulation of the LCP. Thus, this work builds upon [16]. There, we studied Gamma-robustified LCPs for … Read more