Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 10 min ago
PreprintCC BY 4.0arXiv

Splitting Algorithms Using Pairs Monotonicity to Solve the Sum of Two Non-monotone Operators Problem

  • Ba Khiet Le
  • Zakaria Mazgouri
  • Michel Théra
Open at sourcePDFDOICite

Abstract

This paper is concerned with solving the problem of finding a zero of the sum of a single-valued operator and a set-valued operator, neither of which is assumed to be monotone, in a real Hilbert space. Under the framework of pair monotonicity, we propose a generalized forward--backward algorithm and a generalized Tseng algorithm based on transformed and warped resolvents associated with an auxiliary linear operator. We establish weak, strong and linear convergence of the proposed algorithms under suitable assumptions involving pair strong monotonicity, pair cocoercivity, and pair Lipschitz continuity. Finally, numerical experiments are presented to validate the theoretical results and demonstrate the effectiveness of the proposed algorithms.

Related

  1. Splitting Compositions of Monotone Operators
    Haoming Qu, Yefan Wu, Thomas Chaffey
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Weak and strong convergence of a general splitting approach for monotone multioperator inclusions
    Minh N. Dao, Matthew K. Tam, Thang D. Truong
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A primal-dual splitting algorithm for monotone inclusions with applications
    Changchi Huang, Jigen Peng, Liqian Qin +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
    Ba Khiet Le, Boris S. Mordukhovich, Michel A. Thera
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities
    Jun-Hyun Kim, Ahmet Alacaoglu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{le2026splitting,
  title = {{Splitting Algorithms Using Pairs Monotonicity to Solve the Sum of Two Non-monotone Operators Problem}},
  author = {Ba Khiet Le and Zakaria Mazgouri and Michel Théra},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.27974},
  eprint = {2609.27974},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.27974},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Splitting Algorithms Using Pairs Monotonicity to Solve the Sum of Two Non-monotone Operators Problem
AU  - Ba Khiet Le
AU  - Zakaria Mazgouri
AU  - Michel Théra
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.27974
UR  - https://arxiv.org/abs/2609.27974
AB  - This paper is concerned with solving the problem of finding a zero of the sum of a single-valued operator and a set-valued operator, neither of which is assumed to be monotone, in a real Hilbert space. Under the framework of pair monotonicity, we propose a generalized forward--backward algorithm and a generalized Tseng algorithm based on transformed and warped resolvents associated with an auxiliary linear operator. We establish weak, strong and linear convergence of the proposed algorithms under suitable assumptions involving pair strong monotonicity, pair cocoercivity, and pair Lipschitz continuity. Finally, numerical experiments are presented to validate the theoretical results and demonstrate the effectiveness of the proposed algorithms.
ER  -