Abstract
The authors introduced in previously published papers acceleration schemes for Projected Aggregation Methods (PAM), aiming at solving consistent linear systems of equalities and inequalities. They have used the basic idea of forcing each iterate to belong to the aggregate hyperplane generated in the previous iteration. That scheme has been applied to a variety of projection algorithms for solving systems of linear equalities or inequalities, proving that the acceleration technique can be successfully used for consistent problems. The aim of this paper is to extend the applicability of those schemes to the inconsistent case, employing incomplete projections onto the set of solutions of the augmented system Ax − r = b. These extended algorithms converge to the least squares solution. For that purpose, oblique projections are used and, in particular, variable oblique incomplete projections are introduced. They are defined by means of matrices that penalize the norm of the residuals very strongly in the first iterations, decreasing their influence with the iteration counter in order to fulfill the convergence conditions. The theoretical properties of the new algorithms are analyzed, and numerical experiences are presented comparing their performance with several well-known projection methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Browne, J.A., Herman, G.T., Odhner, D.: SNARK93: A Programming System for Image Reconstruction from Projections. Department of Radiology, University of Pennsylvania, Medical Image Processing Group, Technical Report MIPG198 (1993)
Byrne C. (2002). Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18: 441–453
Byrne C. and Censor Y. (2001). Proximity function minimization using multiple Bregman projections with applications to split feasibility and Kullback–Leibler distance minimization. Ann. Oper. Res. 105: 77–98
Censor Y. and Elfving T. (2002). Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem. SIAM J. Matrix Anal. Appl. 24: 40–58
Censor Y. and Zenios S. (1997). Parallel Optimization: Theory and Applications. Oxford University Press, New York
Censor Y., Gordon D. and Gordon R. (2001). Component averaging: an efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. 27: 777–808
Combettes P.L. (1994). Inconsistent signal feasibility problems: least-squares solutions in a product space. IEEE Trans. Signal Process. 42: 2955–2966
Csiszár I. and Tusnády G. (1984). Information geometry and alternating minimization procedures. Stat. Decis. Suppl. 1: 205–237
Echebest N., Guardarucci M.T., Scolnik H.D. and Vacchino M.C. (2004). An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms. Numer. Algorithms 35(2–4): 335–350
García Palomares U.M. (1993). Parallel projected aggregation methods for solving the convex feasibility problem. SIAM J. Optim. 3: 882–900
Herman G.T. (1980). Image Reconstruction From Projections: The Fundamentals of Computarized Tomography. Academic, New York
Herman G.T. and Meyer LB (1993). Algebraic reconstruction techniques can be made computationally efficient. IEEE Trans. Med. Imaging 12: 600–609
Householder A.S. and Bauer F.L. (1960). On certain iterative methods for solving linear systems. Numer. Math. 2: 55–59
Jiang M. and Wang G. (2003). Convergence studies on iterative Algorithms for Image Reconstruction. IEEE Trans. Med. Imaging 22: 569–579
Kaczmarz S. (1937). Angenäherte Auflösung von Systemen linearer Gleichungen. Bull. Int. Acad. Pol. Sci. Lett. 35: 355–357
Landweber L. (1951). An iteration formula for Fredholm integral equations of the first kind. Am. J. Math. 73: 615–624
Ortega J.M. and Rheinboldt W.C. (1970). Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York, London
Popa C. (1998). Extensions of Block-Projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems. BIT 38: 151–176
Scolnik, H.D., Echebest, N., Guardarucci, M.T., Vacchino, M.C.: New optimized and accelerated PAM methods for solving large non-symmetric linear systems: theory and practice. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics, vol. 8, pp. 457–470. Elsevier Science Publishers, Amsterdam, The Netherlands (2001)
Scolnik H.D., Echebest N., Guardarucci M.T. and Vacchino M.C. (2002). A class of optimized row projection methods for solving large non-symmetric linear systems. Appl. Numer. Math. 41: 499–513
Scolnik H.D., Echebest N., Guardarucci M.T. and Vacchino M.C. (2002). Acceleration scheme for Parallel Projected Aggregation Methods for solving large linear systems. Ann. Oper. Res. 117: 95–115
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Clovis Gonzaga on the occassion of his 60th birthday.
Rights and permissions
About this article
Cite this article
Scolnik, H.D., Echebest, N., Guardarucci, M.T. et al. Incomplete oblique projections for solving large inconsistent linear systems. Math. Program. 111, 273–300 (2008). https://doi.org/10.1007/s10107-006-0066-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0066-4