A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Alves, M. Marques, Caballero, J. E. Navarro, Geremia, M., Marcavillaca, R. T.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912600338464768
author Alves, M. Marques
Caballero, J. E. Navarro
Geremia, M.
Marcavillaca, R. T.
author_facet Alves, M. Marques
Caballero, J. E. Navarro
Geremia, M.
Marcavillaca, R. T.
contents We propose an inertial variant of the strongly convergent inexact proximal-point (PP) method of Solodov and Svaiter (2000) for monotone inclusions. We prove strong convergence of our main algorithm under less restrictive assumptions on the inertial parameters when compared to previous analysis of inertial PP-type algorithms, which makes our method of interest even in finite-dimensional settings. We also performed an iteration-complexity analysis and applied our main algorithm to variational inequalities for monotone operators, obtaining strongly convergent (inertial) variants of Korpolevich's extragradient, forward-backward and Tseng's modified forward-backward methods. Preliminary numerical experiments indicate that our strongly convergent variant of Tseng's modified forward-backward method performs well on certain matrix game problems.
format Preprint
id arxiv_https___arxiv_org_abs_2407_03485
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities
Alves, M. Marques
Caballero, J. E. Navarro
Geremia, M.
Marcavillaca, R. T.
Optimization and Control
We propose an inertial variant of the strongly convergent inexact proximal-point (PP) method of Solodov and Svaiter (2000) for monotone inclusions. We prove strong convergence of our main algorithm under less restrictive assumptions on the inertial parameters when compared to previous analysis of inertial PP-type algorithms, which makes our method of interest even in finite-dimensional settings. We also performed an iteration-complexity analysis and applied our main algorithm to variational inequalities for monotone operators, obtaining strongly convergent (inertial) variants of Korpolevich's extragradient, forward-backward and Tseng's modified forward-backward methods. Preliminary numerical experiments indicate that our strongly convergent variant of Tseng's modified forward-backward method performs well on certain matrix game problems.
title A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities
topic Optimization and Control
url https://arxiv.org/abs/2407.03485