In this paper, we introduce the class of multivalued relaxed μ quasimonotone operators and establish the existence of solutions of variational inequalities for such operators. This result is compared with a recent result of Bai et al on densely relaxed pseudomonotone operators. A similar comparison regarding an existence result of Luc on densely pseudomonotone operators is provided. Also, we in...

In this paper, we propose an inexact alternating direction method with square quadratic proximal  (SQP) regularization for  the structured variational inequalities. The predictor is obtained via solving SQP system  approximately  under significantly  relaxed accuracy criterion  and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...

Despite its success, the delete relaxation has significant pitfalls. In an attempt to overcome these pitfalls, recent work has devised so-called red-black relaxed plan heuristics, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. These heuristics were shown to significantly improve over standard delete relaxation heuris...

Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many di erent relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performa...

We propose a formalized method that allows to automatically derive an optimized implementation from the formal speciication of a protocol. Our method starts with the SDL speciication of a protocol stack. We rst derive a data and control ow dependence graph from each SDL process. Then, in order to perform cross-layer optimizations we combine the dependence graphs of diierent SDL processes. Next,...

This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar’s proximal method of multipliers (PMM) for solving smooth convex programming problems with inequality constraints. In each step, either a step of Rockafellar’s PMM for a second-order model of the problem is computed or a relaxed extragradient step is performed. The resulting algorithm is a (large-ste...

We propose a novel method to obtain a part of an optimal non-relaxed integral solution for energy minimization problems with Potts interactions, known also as the minimal partition problem. The method empirically outperforms previous approaches like MQPBO and Kovtun’s method in most of our test instances and especially in hard ones. As a starting point our approach uses the solution of a common...

A random simulation method was used for treatment of systems of Volterra integral equations of the second kind. Firstly, a linear algebra system was obtained by discretization using quadrature formula. Secondly, this algebra system was solved by using relaxed Monte Carlo method with importance sampling and numerical approximation solutions of the integral equations system were achieved. It is t...