Iterative numerical algorithms for variational inequalities are systematically constructed from fixed-point problem characterizations in terms of resolvent operators. The applied method is the one introduced by Gabay ...
详细信息
Iterative numerical algorithms for variational inequalities are systematically constructed from fixed-point problem characterizations in terms of resolvent operators. The applied method is the one introduced by Gabay in [Ga], used here in the context of discrete variational inequalities, and with the emphasis on mixed finite element models. The algorithms apply to nonnecessarily potential problems, generalizing primal and mixed Uzawa and augmented Lagrangian-type algorithms. They are also identified with Euler and operator splitting methods for the time discretization of evolution first-order problems.
暂无评论