arXiv (All)
open access
Efficient iterative techniques for solving tensor problems with the T-product
This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal resid
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
- Convergent Plug-and-Play Image Restoration with Annealed Noise Levels#1116724
- Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration#974341
- Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral Sandwich#451314
- Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints#996513
- Mixed-Noise Plug-and-Play with Infimal Convolution Fidelities and Multiple Priors#1118970
Record · ID 1036547
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