arXiv (All)
open access
Coupled Adaptable Backward-Forward-Backward Resolvent Splitting Algorithm (CABRA): A Matrix-Parametrized Resolvent Splitting Method for the Sum of Maximal Monotone and Cocoercive Operators Composed with Linear Coupling Operators
We present a novel matrix-parametrized frugal splitting algorithm which finds a zero of a sum of maximal monotone and cocoercive operators composed with linear selection operators, which models a large class of problems in which the operators take only a subset of decision variables as their input.
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
- Gradient-based linear and nonlinear dimension reduction#796302
- Online reduced-order modeling from primal solver trajectories for PDE-constrained optimization#1354504
- Beyond Compression: Training Latent Representations for Stable Long-Horizon Rollout in Neural Surrogate Solvers#1078269
- Enhancing Transformer Representations of Symbolic ODE Expressions#1051149
- Enhancing Transformer Representations of Symbolic ODE Expressions#1028698
Record · ID 1324467
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