Abstract
We prove that the underrelaxed version of the sequence generated by the multiplicative algebraic reconstruction technique (MART) for equalities in the inconsistent case converges to the solution of an optimization problem, as it is the case in the algebraic reconstruction technique (ART), if the relaxation parameters satisfy certain conditions. This method of proof is based on the relationship that exists between the underrelaxed ART and the optimization problem it solves in the inconsistent case. The majorizing function for the simultaneous version of MART (SMART) which could be used to prove its convergence has also been derived.
Original language | English |
---|---|
Article number | 88 |
Journal | Operations Research Forum |
Volume | 4 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 2023 |
Keywords
- Inconsistent system of equations
- Kullback-Leibler distance
- Multiplicative algebraic reconstruction technique