arXiv Analytics

Sign in

arXiv:1911.02799 [math.NA]AbstractReferencesReviewsResources

Solving Inverse Problems for Steady-State Equations using A Multiple Criteria Model with Collage Distance, Entropy, and Sparsity

Herb Kunze, Davide La Torre

Published 2019-11-07Version 1

In this paper, we extend the previous method for solving inverse problems for steady-state equations using the Generalized Collage Theorem by searching for an approximation that not only minimizes the collage error but also maximizes the entropy and minimize the sparsity. In this extended formulation, the parameter estimation minimization problem can be understood as a multiple criteria problem, with three different and conflicting criteria: The generalized collage error, the entropy associated with the unknown parameters, and the sparsity of the set of unknown parameters. We implement a scalarization technique to reduce the multiple criteria program to a single criterion one, by combining all objective functions with different trade-off weights. Numerical examples confirm that the collage method produces good, but sub-optimal, results. A relatively low-weighted entropy term allows for better approximations while the sparsity term decreases the complexity of the solution in terms of the number of elements in the basis.

Related articles: Most relevant | Search more
arXiv:1705.09992 [math.NA] (Published 2017-05-28)
LAP: a Linearize and Project Method for Solving Inverse Problems with Coupled Variables
arXiv:2401.09445 [math.NA] (Published 2023-12-20)
Quadratic neural networks for solving inverse problems
arXiv:2011.03627 [math.NA] (Published 2020-11-06)
Discretization of learned NETT regularization for solving inverse problems