Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems

Abstract

Well-posedness, conditioning and regularization of fixed-point problems are studied in connexion with well-posedness, conditioning and Tikhonov regularization of minimization and inclusion problems. Equivalence theorems are proved. Coupling iteration and well-posedness as well as iteration and regularization are also considered.