A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions (2401.05292v1)
Abstract: We propose a primal-dual backward reflected forward splitting method for solving structured primal-dual monotone inclusion in real Hilbert space. The algorithm allows to use the inexact computations of the Lipschitzian and cocoercive operators. The strong convergence of the generated iterative sequence is proved under the strong monotonicity condition, whilst the weak convergence is formally proved under several conditioned used in the literature. An application to a structured minimization problem is supported.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.