arXiv (All)
open access
Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems
In this paper we propose a novel regularisation strategy for structured linear inverse problems of the form $Ax=F \circ G x = z$. Instead of using the operator $A$ or a complex scheme involving both $F$ and $G$ simultaneously, combining already existing and simpler regularisations for $F$ and $G$ al
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
- Splines and Operators: Part II - Resolution of Inverse Problems#1325816
- Injecting Measurement Information Yields a Fast and Noise-Robust Diffusion-Based Inverse Problem Solver#177108
- Algorithm with variable coefficients for computing matrix inverses#665672
- Algorithm with variable coefficients for computing matrix inverses#664172
- A method for the solution of certain non-linear problems in least squares#6874
Record · ID 1297835
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