Related papers: Weak convergence on Douglas-Rachford method
The aim of this article is to study a Cahn-Hilliard model for a multicomponent mixture with cross-diffusion effects, degenerate mobility and where only one of the species does separate from the others. We define a notion of weak solution…
In this paper, we propose a weak formulation of the singular diffusion equation subject to the dynamic boundary condition. The weak formulation is based on a reformulation method by an evolution equation including the subdifferential of a…
The Douglas--Rachford algorithm is a popular algorithm for solving both convex and nonconvex feasibility problems. While its behaviour is settled in the convex inconsistent case, the general nonconvex inconsistent case is far from being…
For any $\alpha $ small, we construct infinitely many $C^{1,\alpha}$ very weak solutions to the 2-Hessian equation with prescribed boundary value. The proof relies on the convex integration method and cut-off technique.
The Douglas-Rachford splitting method is a classical and widely used algorithm for solving monotone inclusions involving the sum of two maximally monotone operators. It was recently shown to be the unique frugal, no-lifting…
The aim of this paper is to extend the aggregation convergence results given in (Dacunha-Castelle and Fermin 2005, Dacunha-Castelle and Fermin 2008) to doubly stochastic linear and nonlinear processes with weakly dependent innovations.…
Based on a degenerate proximal point analysis, we show that the Douglas-Rachford splitting can be reduced to a well-defined resolvent, but generally fails to be a proximal mapping. This extends the recent result of [Bauschke, Schaad and…
The Douglas-Rachford algorithm can be represented as the fixed point iteration of a firmly nonexpansive operator. When the operator has no fixed points, the algorithm's iterates diverge, but the difference between consecutive iterates…
We establish the weak continuity of the Gauss-Coddazi-Ricci system for isometric embedding with respect to the uniform $L^p$-bounded solution sequence for $p>2$, which implies that the weak limit of the isometric embeddings of the manifold…
In this paper, we shall study the existence of weak solutions to Hessian type equations on compact Riemannian manifolds without boundary.
We prove that the Douglas--Rachford method applied to two closed convex cones in the Euclidean plane converges in finitely many steps if and only if the set of fixed points of the Douglas--Rachford operator is nontrivial. We analyze this…
A simple-to-implement weak-sense numerical method to approximate reflected stochastic differential equations (RSDEs) is proposed and analysed. It is proved that the method has the first order of weak convergence. Together with the Monte…
We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized aggregative…
A numerical method for approximating weak solutions of an aggregation equation with degenerate diffusion is introduced. The numerical method consists of a stabilized finite element method together with a mass lumping technique and an extra…
In this paper we propose two different primal-dual splitting algorithms for solving inclusions involving mixtures of composite and parallel-sum type monotone operators which rely on an inexact Douglas-Rachford splitting method, however…
Proximal splitting algorithms for monotone inclusions (and convex optimization problems) in Hilbert spaces share the common feature to guarantee for the generated sequences in general weak convergence to a solution. In order to achieve…
The Douglas-Rachford algorithm is a popular method for finding zeros of sums of monotone operators. By its definition, the Douglas-Rachford operator is not symmetric with respect to the order of the two operators. In this paper we provide a…
In this work, we prove a weak Harnack estimate for the weak supersolutions to the porous medium equation. The proof is based on a priori estimates for the supersolutions and measure theoretical arguments.
Splitting and projection-type algorithms have been applied to many optimization problems due to their simplicity and efficiency, but the application of these algorithms to optimal control is less common. In this paper we utilize the…
We prove a weak rate of convergence of a fully discrete scheme for stochastic Cahn--Hilliard equation with additive noise, where the spectral Galerkin method is used in space and the backward Euler method is used in time. Compared with the…