A certain constrained vector-valued dynamic game is formulated and shown to be equivalent to a pair of multiobjective symmetric dual variational problems which have more general formulations than those studied earlier. A number of duality theorems, are established under suitable generalized convexity assumptions on the functionals. Selfduality reflecting symmetric dynamic games is investigated....

Preconditioning by a conjugate projector is combined with the recently proposed MPRGP algorithm for the solution of bound constrained quadratic programming problems. If applied to the partially bound constrained problems, such as those arising from the application of FETI based domain decomposition methods to the discretized elliptic boundary variational inequalities, the resulting algorithm is...

Some mechanical problems involve inequality kinematic constraint. This study deals with an original approach to handle those difficult problems. The main issue is the treatment of the variational inequalities due to the fact that the constrained area is a priori unknown. The method, introduced here, is to find the exact constrained area iteratively starting from an intial trial one. Thanks to n...

Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and surfaces, are determined as minimizers of functionals using e.g. the variational level set method. In this paper we consider such variational problems with constraints given by functionals. We use the geometric interpretation ...

In this paper we investigate a variational discretization for the class of mechanical systems in presence of symmetries described by the action of a Lie group which reduces the phase space to a (non-trivial) principal bundle. By introducing a discrete connection we are able to obtain the discrete constrained higher-order Lagrange-Poincar\'e equations. These equations describe the dynamics of a ...

The weighted quasi-variational inequalities over product of sets (for short, WQVIP) and system of weighted quasi-variational inequalities (for short, SWQVI) are introduced. It is shown that these two problems are equivalent. A relationship between SWQVI and system of vector quasi-variational inequalities is given. The concept of normalized solutions of WQVIP and SWQVI is introduced. A relations...

In this paper we derive efficiency estimates of the regularized Newton’s method as applied to constrained convex minimization problems and to variational inequalities. We study a one-step Newton’s method and its multistep accelerated version, which converges on smooth convex problems as O( 1 k3 ), where k is the iteration counter. We derive also the efficiency estimate of a second-order scheme ...