![]() |
![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
![]() |
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|
ETNA - Electronic Transactions on Numerical Analysis, pp. 66-91, 2024/07/03
This paper describes software for the solution of finite-dimensional minimization problemswith two terms, a fidelity term and a regularization term. The sum of the $p$-norm of theformer and the $q$-norm of the latter is minimized, where $0 < p,q\leq 2$. We note that the“$p$-norm” is not a norm when $ 0< p < 1$, and similarly for the “$q$-norm”. This kind ofminimization problems arises when solving linear discrete ill-posed problems, such ascertain problems in image restoration. They also find applications in statistics.Recently, limited-memory restarted numerical methods that are well suited for the solutionof large-scale minimization problems of this kind were described by the authors in[Adv. Comput. Math., 49 (2023), Art. 26]. Thesemethods are based on the application of restarted generalized Krylov subspaces. This paperpresents software for these solution methods.
Keywords: $l^p$-$l^q$ minimization, inverse problem, regression, iterative method