arXiv (All)
open access
Splitting Algorithms Using Pairs Monotonicity to Solve the Sum of Two Non-monotone Operators Problem
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reflected three-operator splitting method for monotone inclusion problem#384936
- Toward Quantum Advantage in Learning Parities with Structured Noise via Lower Bound Optimization of the Condition Number#467069
- Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem#625472
- Structured Divide-and-Conquer for the Definite Generalized Eigenvalue Problem#623199
- Improving ADMMs for solving doubly nonnegative programs through dual factorization#246996
Record · ID 1064518
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive