A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bang, Vu Cong, Papadimitriou, Dimitri, Nham, Vu Xuan
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910293539422208
author Bang, Vu Cong
Papadimitriou, Dimitri
Nham, Vu Xuan
author_facet Bang, Vu Cong
Papadimitriou, Dimitri
Nham, Vu Xuan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2401_05292
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions
Bang, Vu Cong
Papadimitriou, Dimitri
Nham, Vu Xuan
Optimization and Control
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.
title A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions
topic Optimization and Control
url https://arxiv.org/abs/2401.05292