We introduce and analyze a Nitsche-based domain decomposition method for the solution of hypersingular integral equations. This method allows for discretizations with non-matching grids without the necessity of a Lagrangian multiplier, as opposed to the traditional mortar method. We prove its almost quasi-optimal convergence and underline the theory by a numerical experiment.

This paper develops a new error criterion for the approximate minimization of augmented Lagrangian subproblems. This criterion is practical in the sense that it requires only information that is ordinarily readily available, such as the gradient (or a subgradient) of the augmented Lagrangian. It is also “relative” in the sense of relative error criteria for proximal point algorithms, in that it...

We present an alternative formulation of duality-symmetric eleven-dimensional supergravity with both three-form and six-form gauge fields. Instead of the recently-proposed scalar auxiliary field, we use a simpler lagrangian with a non-propagating auxiliary multiplier tensor field with eight-indices. We also complete the superspace formulation in a duality-symmetric manner. An alternative super ...

In this article, we discuss the numerical solution of the Stokes and Navier-Stokes equations completed by nonlinear slip boundary conditions of friction type in two and three dimensions. To solve the Stokes system, we first reduce the related variational inequality into a saddle point-point problem for a well chosen augmented Lagrangian. To solve this saddle point problem we suggest an alternat...

We present an alternative formulation of duality-symmetric eleven-dimensional supergravity with both three-form and seven-form gauge fields. Instead of the recently-proposed scalar auxiliary field, we use a simpler lagrangian with a non-propagating auxiliary multiplier tensor field with eight-indices. We also complete the superspace formulation in a duality-symmetric manner. An alternative supe...

Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively combines an alternating direction technique with a nonmonotone line search to minimize the augmented Lagrangian funct...

We present an alternative formulation of duality-symmetric eleven-dimensional supergravity with both three-form and six-form gauge fields. Instead of the recently-proposed scalar auxiliary field, we use a simpler lagrangian with a non-propagating auxiliary multiplier tensor field with eight-indices. We also complete the superspace formulation in a duality-symmetric manner. An alternative super ...

This paper presents an augmented Lagrangian algorithm to solve continuous constrained global optimization problems. The algorithm approximately solves a sequence of bound constrained subproblems whose objective function penalizes equality and inequality constraints violation and depends on the Lagrange multiplier vectors and a penalty parameter. Each subproblem is solved by a population-based m...

When does there exist an optimal generating Lagrangian multi-plier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper cons...