Skip to main content

CONTRIBUCIONES AL ANALISIS VARIACIONAL: FUNDAMENTOS, DUALIDAD, ROBUSTEZ Y ALGORITMOS

PRE2019-090751

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprogram Subprograma Estatal de Formación
Call Contratos Predoctorales
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE ALICANTE

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Distributed forward-backward methods for ring networks

  • Aragón Artacho, Francisco Javier
  • Malitsky, Yura
  • Tam, Matthew K.
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two operator inclusion in the product space. Each iteration of the studied algorithms requires one resolvent evaluation per set-valued operator, one forward evaluation per cocoercive operator, and two forward evaluations per monotone operator. Unlike existing methods, the structure of the proposed algorithms are suitable for distributed, decentralised implementation in ring networks without needing global summation to enforce consensus between nodes.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A Direct Proof of Convergence of Davis–Yin Splitting Algorithm Allowing Larger Stepsizes

  • Aragón Artacho, Francisco Javier
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
This note is devoted to the splitting algorithm proposed by Davis and Yin (Set-valued Var. Anal. 25(4), 829–858, 2017) for computing a zero of the sum of three maximally monotone operators, with one of them being cocoercive. We provide a direct proof that guarantees its convergence when the stepsizes are smaller than four times the cocoercivity constant, thus doubling the size of the interval established by Davis and Yin. As a by-product, the same conclusion applies to the forward-backward splitting algorithm. Further, we use the notion of “strengthening” of a set-valued operator to derive a new splitting algorithm for computing the resolvent of the sum. Last but not least, we provide some numerical experiments illustrating the importance of appropriately choosing the stepsize and relaxation parameters of the algorithms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting

  • Aragón Artacho, Francisco Javier
  • Boţ, Radu I.
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
In this work, we study resolvent splitting algorithms for solving composite monotone inclusion problems. The objective of these general problems is finding a zero in the sum of maximally monotone operators composed with linear operators. Our main contribution is establishing the first primal-dual splitting algorithm for composite monotone inclusions with minimal lifting. Specifically, the proposed scheme reduces the dimension of the product space where the underlying fixed point operator is defined, in comparison to other algorithms, without requiring additional evaluations of the resolvent operators. We prove the convergence of this new algorithm and analyze its performance in a problem arising in image deblurring and denoising. This work also contributes to the theory of resolvent splitting algorithms by extending the minimal lifting theorem recently proved by Malitsky and Tam to schemes with resolvent parameters.