• Ronny Ramlau, Lothar Reichel (Hg.)

ETNA - Electronic Transactions on Numerical Analysis

Bild


Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.

…

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

Bestellung/Order


Bild
ETNA - Electronic Transactions on Numerical Analysis



ISBN 978-3-7001-8258-0
Online Edition



Send or fax to your local bookseller or to:

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: bestellung.verlag@oeaw.ac.at
UID-Nr.: ATU 16251605, FN 71839x Handelsgericht Wien, DVR: 0096385

Bitte senden Sie mir
Please send me
 
Exemplar(e) der genannten Publikation
copy(ies) of the publication overleaf


NAME


ADRESSE / ADDRESS


ORT / CITY


LAND / COUNTRY


ZAHLUNGSMETHODE / METHOD OF PAYMENT
    Visa     Euro / Master     American Express


NUMMER

Ablaufdatum / Expiry date:  

    I will send a cheque           Vorausrechnung / Send me a proforma invoice
 
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)
Bild

Biased superiorization of steepest descent: redefining the reconstruction target in noisy inverse problems

    Touraj Nikazad, Mokhtar Abbasi

ETNA - Electronic Transactions on Numerical Analysis, pp. 93-109, 2026/02/16

doi: 10.1553/etna_vol65s93

doi: 10.1553/etna_vol65s93


PDF
X
BibTEX-Export:

X
EndNote/Zotero-Export:

X
RIS-Export:

X 
Researchgate-Export (COinS)

Permanent QR-Code

doi:10.1553/etna_vol65s93



doi:10.1553/etna_vol65s93

Abstract

Reconstruction in inverse problems is commonly performed by minimizing a data-fidelity term, such as the least-squares objective. However, when the data are noisy, this minimizer may not represent the true solution. The superiorization methodology attempts to improve the structure of the solution by perturbing iterative schemes, but such methods still target the noisy data-fit minimizer. This work proposes a paradigm shift: rather than improving convergence to a flawed target, we redefine the reconstruction goal itself. We introduce the Superiorized Biased Steepest Descent (S-BSD-LS) algorithm, which combines two key components: (i) a deliberately biased residual update that decouples the method from the noisy least-squares solution and (ii) a total variation (TV) perturbation that promotes a desirable structure. We rigorously analyze convergence of the algorithm using an auxiliary sequence and characterize the systematic bias induced by both the residual update and the data noise. This approach offers a new perspective on solving ill-posed noisy problems. We demonstrate the performance of our proposed method, S-BSD-LS, for tomographic imaging examples using total variation regularization as a specific instance of the general framework and compare it with state-of-the-art methods, including the standard steepest descent method, the conjugate gradient method for least-squares (CGLS) , the superiorized conjugate gradient method with conjugate descent (S-CG-CD), and FISTA, a well-known proximal gradient algorithm. In each iteration, S-BSD-LS requires two matrix-vector multiplications—similar to CGLS—and one additional function evaluation compared to CGLS while still maintaining competitive performance. Additional experiments confirm that the superiorization mechanism is primarily responsible for the improved stability and a continuous error reduction while the biased residual update mainly enhances computational efficiency.

Keywords: inverse problems, superiorized, biased steepest descent, tomographic imaging, total variation