An incomplete projections algorithm for solving large inconsistent linear systems

Autores
Scolnik, Hugo Daniel; Echebest, Nélida Ester; Guardarucci, María Teresa; Vacchino, María Cristina
Año de publicación
2005
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate x k+1 by projecting the current point x k onto a separating hyperplane generated by a given linear combination of the original hyperplanes and/or halfspaces. The authors have introduced in several papers new acceleration schemes for solving systems of linear equations and inequalities respectively, within a PAM like framework. The basic idea was to force the next iterate to belong to the convex region defined by the new separating or aggregated hyperplane computed in the previous iteration. In this paper the above mentioned methods are extended to the problem of finding the least squares solution to inconsistent systems. The new algorithm is based upon a new scheme of incomplete alternate projections for minimizing the proximity function. The parallel simultaneous projections ACCIM algorithm, published by the authors, is the basis for calculating the incomplete intermediate projections. The convergence properties of the new algorithm are given together with numerical experiences obtained by applying it to image reconstruction problems using the SNARKQ3 system.
Facultad de Ciencias Exactas
Materia
Matemática
Projected aggregation methods
Incomplete projections
Inconsistent system
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/150084

id SEDICI_b620ce1764f23f0e329d608052609229
oai_identifier_str oai:sedici.unlp.edu.ar:10915/150084
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An incomplete projections algorithm for solving large inconsistent linear systemsScolnik, Hugo DanielEchebest, Nélida EsterGuardarucci, María TeresaVacchino, María CristinaMatemáticaProjected aggregation methodsIncomplete projectionsInconsistent systemThe Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate x k+1 by projecting the current point x k onto a separating hyperplane generated by a given linear combination of the original hyperplanes and/or halfspaces. The authors have introduced in several papers new acceleration schemes for solving systems of linear equations and inequalities respectively, within a PAM like framework. The basic idea was to force the next iterate to belong to the convex region defined by the new separating or aggregated hyperplane computed in the previous iteration. In this paper the above mentioned methods are extended to the problem of finding the least squares solution to inconsistent systems. The new algorithm is based upon a new scheme of incomplete alternate projections for minimizing the proximity function. The parallel simultaneous projections ACCIM algorithm, published by the authors, is the basis for calculating the incomplete intermediate projections. The convergence properties of the new algorithm are given together with numerical experiences obtained by applying it to image reconstruction problems using the SNARKQ3 system.Facultad de Ciencias Exactas2005info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf61-71http://sedici.unlp.edu.ar/handle/10915/150084enginfo:eu-repo/semantics/altIdentifier/issn/0716-7563info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T17:19:27Zoai:sedici.unlp.edu.ar:10915/150084Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 17:19:27.545SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An incomplete projections algorithm for solving large inconsistent linear systems
title An incomplete projections algorithm for solving large inconsistent linear systems
spellingShingle An incomplete projections algorithm for solving large inconsistent linear systems
Scolnik, Hugo Daniel
Matemática
Projected aggregation methods
Incomplete projections
Inconsistent system
title_short An incomplete projections algorithm for solving large inconsistent linear systems
title_full An incomplete projections algorithm for solving large inconsistent linear systems
title_fullStr An incomplete projections algorithm for solving large inconsistent linear systems
title_full_unstemmed An incomplete projections algorithm for solving large inconsistent linear systems
title_sort An incomplete projections algorithm for solving large inconsistent linear systems
dc.creator.none.fl_str_mv Scolnik, Hugo Daniel
Echebest, Nélida Ester
Guardarucci, María Teresa
Vacchino, María Cristina
author Scolnik, Hugo Daniel
author_facet Scolnik, Hugo Daniel
Echebest, Nélida Ester
Guardarucci, María Teresa
Vacchino, María Cristina
author_role author
author2 Echebest, Nélida Ester
Guardarucci, María Teresa
Vacchino, María Cristina
author2_role author
author
author
dc.subject.none.fl_str_mv Matemática
Projected aggregation methods
Incomplete projections
Inconsistent system
topic Matemática
Projected aggregation methods
Incomplete projections
Inconsistent system
dc.description.none.fl_txt_mv The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate x k+1 by projecting the current point x k onto a separating hyperplane generated by a given linear combination of the original hyperplanes and/or halfspaces. The authors have introduced in several papers new acceleration schemes for solving systems of linear equations and inequalities respectively, within a PAM like framework. The basic idea was to force the next iterate to belong to the convex region defined by the new separating or aggregated hyperplane computed in the previous iteration. In this paper the above mentioned methods are extended to the problem of finding the least squares solution to inconsistent systems. The new algorithm is based upon a new scheme of incomplete alternate projections for minimizing the proximity function. The parallel simultaneous projections ACCIM algorithm, published by the authors, is the basis for calculating the incomplete intermediate projections. The convergence properties of the new algorithm are given together with numerical experiences obtained by applying it to image reconstruction problems using the SNARKQ3 system.
Facultad de Ciencias Exactas
description The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate x k+1 by projecting the current point x k onto a separating hyperplane generated by a given linear combination of the original hyperplanes and/or halfspaces. The authors have introduced in several papers new acceleration schemes for solving systems of linear equations and inequalities respectively, within a PAM like framework. The basic idea was to force the next iterate to belong to the convex region defined by the new separating or aggregated hyperplane computed in the previous iteration. In this paper the above mentioned methods are extended to the problem of finding the least squares solution to inconsistent systems. The new algorithm is based upon a new scheme of incomplete alternate projections for minimizing the proximity function. The parallel simultaneous projections ACCIM algorithm, published by the authors, is the basis for calculating the incomplete intermediate projections. The convergence properties of the new algorithm are given together with numerical experiences obtained by applying it to image reconstruction problems using the SNARKQ3 system.
publishDate 2005
dc.date.none.fl_str_mv 2005
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/150084
url http://sedici.unlp.edu.ar/handle/10915/150084
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0716-7563
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
61-71
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846783610798997504
score 12.982451