Search arXivSearch

arXiv · 2607.12613

Tensor-Based Reduced-Order Modeling for Optimization-Based Inverse Problems

Abstract

We develop a tensor reduced-order modeling (TROM) framework for optimization-based inverse problems governed by parameter-dependent dynamical systems. The approach approximates the parameter-to-observation map directly in tensor-train (TT) format using TT-SVD or TT-Cross and integrates it into a regularized nonlinear least-squares formulation. Beyond accelerating forward evaluations, the low-rank tensor structure reformulates the inverse problem in reduced coordinates, assembles Gauss--Newton quantities without forming the full observation-space Jacobian, and minimizes the TROM objective over the discrete parameter grid. This tensor optimization provides either a stand-alone approximate solution or a data-informed initialization for a subsequent Gauss--Newton solve. We study an inverse heat-transfer problem in a heterogeneous medium, where the parameters describe the locations and radii of low-conductivity inclusions, and a FitzHugh--Nagumo parameter-estimation problem with a highly nonconvex landscape. Numerical experiments assess reduced-order model error, measurement noise, regularization, initialization, spatial discretization, and increasing parameter dimension. The results show that TROM reproduces full-order inversion at substantially reduced online cost. They also demonstrate that reduced-coordinate inversion, tensor-based optimization, and appropriate regularization improve robustness in higher-dimensional, noisy, and strongly nonconvex regimes. For the continuous TROM inverse problem, we develop an error-to-inversion analysis. Under local strong convexity of the regularized FOM objective and parametric smoothness of the FOM observation map, the error between the parameters recovered with the full-order model and TROM is bounded by controlled uniform errors in the surrogate map and its Jacobian, together with local FOM and curvature quantities.

Explore related subjects

Keep this discovery

BibTeXRIS

Sahidul Islam, Andreas Mang, Maxim Olshanskii. 2026-08-29. Tensor-Based Reduced-Order Modeling for Optimization-Based Inverse Problems. https://arxiv.org/abs/2607.12613

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Optimal control of fractional diffusion with Dirac measures

We study a PDE-constrained optimization problem for an elliptic equation with the spectral fractional Laplacian and a linear combination of Dirac measures as the forcing term; the controls are the amplitudes of these singular sources. We prove existence and uniqueness of an optimal solution and derive first-order optimality conditions. We then propose a discretization based on finite elements. Since the set of admissible controls is finite dimensional, the control variable itself does not require discretization. We conclude by deriving a priori error bounds

math.OC

Two Adjoint Perspectives on Fokker-Planck Optimization: A Microscopic-Macroscopic Correspondence

The Fokker-Planck equation admits both a macroscopic Eulerian description through probability densities and a microscopic Lagrangian description through stochastic trajectories. Consequently, optimization problems constrained by the Fokker-Planck equation can be formulated from either perspective. Surprisingly, the corresponding adjoint equations appear to be fundamentally different: the macroscopic adjoint is governed by the backward Kolmogorov equation, whereas the microscopic adjoint evolves pathwise along stochastic trajectories. In this note, we reconcile these two formulations by establishing their correspondence in the continuum setting. We further show that, although their discrete gradients no longer coincide after discretization, both provide consistent numerical approximations of the continuum gradient. Explicit convergence rates are established for both discretization strategies.

math.NA

DOFFO_TR: a Decentralized Objective Function-Free Optimization method with Trust-Region

In this paper, we propose a novel objective function-free trust-region method designed to solve optimization problems over decentralized networks. Unlike traditional approaches that often rely on stepsize tuning, our framework employs a function-free trust-region procedure that enables adaptive selection of the step length. Our approach accommodates first- and second-order models and eliminates the need to share local function values and gradients among agents, thereby enhancing privacy and computational efficiency. On the theoretical side, we establish provable iteration complexity guarantees that, for some variants, match those established for classical centralized trust-region methods. Numerical evaluations demonstrate that our approach achieves a favorable trade-off between performance and efficiency, requiring only moderate communication overhead compared to state-of-the-art methods in the literature.

math.OC