Mostra el registre parcial de l'element
dc.contributor.author | Campoy, Rubén | |
dc.date.accessioned | 2023-06-15T08:20:47Z | |
dc.date.available | 2023-06-16T04:45:06Z | |
dc.date.issued | 2022 | es_ES |
dc.identifier.citation | Campoy, R. (2022). A product space reformulation with reduced dimension for splitting algorithms. Computational Optimization and Applications, 83 (1), 319-348. | es_ES |
dc.identifier.uri | https://hdl.handle.net/10550/87917 | |
dc.description.abstract | In this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra’s classical reformulation with a different decomposition, which results in a reduction of the dimension of the outcoming product Hilbert space. We discuss the case of not necessarily convex feasibility and best approximation problems. By applying existing splitting methods to the proposed reformulation we obtain new parallel variants of them with a reduction in the number of variables. The convergence of the new algorithms is straightforwardly derived with no further assumptions. The computational advantage is illustrated through some numerical experiments. | es_ES |
dc.language.iso | en | es_ES |
dc.publisher | Springer | es_ES |
dc.subject | pierra’s product space reformulation | es_ES |
dc.subject | splitting algorithm | es_ES |
dc.subject | douglas – rachford algorithm | es_ES |
dc.subject | monotone inclusions | es_ES |
dc.subject | feasibility problem | es_ES |
dc.subject | projection methods | es_ES |
dc.title | A product space reformulation with reduced dimension for splitting algorithms | es_ES |
dc.type | journal article | es_ES |
dc.subject.unesco | UNESCO::CIENCIAS TECNOLÓGICAS | es_ES |
dc.identifier.doi | 10.1007/s10589-022-00395-7 | es_ES |
dc.accrualmethod | CI | es_ES |
dc.embargo.terms | 0 days | es_ES |
dc.type.hasVersion | VoR | es_ES |
dc.rights.accessRights | open access | es_ES |