UNIVERSAL BOUNDS FOR FIXED POINT ITERATIONS VIA OPTIMAL TRANSPORT METRICS

Mario Bravo; Thierry Champion; Roberto Cominetti

doi:10.23952/asvao.4.2022.3.04

UNIVERSAL BOUNDS FOR FIXED POINT ITERATIONS VIA OPTIMAL TRANSPORT METRICS

Mario Bravo, Thierry Champion, Roberto Cominetti

Research output: Contribution to journal › Article › peer-review

Abstract

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for general Krasnosel’skii-Mann fixed point iterations for non-expansive maps. We also describe some of their special properties, including their monotonicity and the so-called convex quadrangle inequality that yields a greedy algorithm for computing them efficiently.

Original language	English
Pages (from-to)	293-310
Number of pages	18
Journal	Applied Set-Valued Analysis and Optimization
Volume	4
Issue number	3
DOIs	https://doi.org/10.23952/asvao.4.2022.3.04
State	Published - 1 Dec 2022
Externally published	Yes

Keywords

Convergence rates
Error bounds
Fixed-point iterations
Non-expansive maps
Optimal transport metrics

Access to Document

10.23952/asvao.4.2022.3.04

Cite this

@article{e054595e66274325bfa5e0b962698b9f,

title = "UNIVERSAL BOUNDS FOR FIXED POINT ITERATIONS VIA OPTIMAL TRANSPORT METRICS",

abstract = "We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for general Krasnosel{\textquoteright}skii-Mann fixed point iterations for non-expansive maps. We also describe some of their special properties, including their monotonicity and the so-called convex quadrangle inequality that yields a greedy algorithm for computing them efficiently.",

keywords = "Convergence rates, Error bounds, Fixed-point iterations, Non-expansive maps, Optimal transport metrics",

author = "Mario Bravo and Thierry Champion and Roberto Cominetti",

note = "Publisher Copyright: {\textcopyright}2022 Applied Set-Valued Analysis and Optimization.",

year = "2022",

month = dec,

day = "1",

doi = "10.23952/asvao.4.2022.3.04",

language = "English",

volume = "4",

pages = "293--310",

journal = "Applied Set-Valued Analysis and Optimization",

issn = "2562-7775",

publisher = "Biemdas Academic Publishers",

number = "3",

}

TY - JOUR

T1 - UNIVERSAL BOUNDS FOR FIXED POINT ITERATIONS VIA OPTIMAL TRANSPORT METRICS

AU - Bravo, Mario

AU - Champion, Thierry

AU - Cominetti, Roberto

PY - 2022/12/1

Y1 - 2022/12/1

N2 - We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for general Krasnosel’skii-Mann fixed point iterations for non-expansive maps. We also describe some of their special properties, including their monotonicity and the so-called convex quadrangle inequality that yields a greedy algorithm for computing them efficiently.

AB - We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for general Krasnosel’skii-Mann fixed point iterations for non-expansive maps. We also describe some of their special properties, including their monotonicity and the so-called convex quadrangle inequality that yields a greedy algorithm for computing them efficiently.

KW - Convergence rates

KW - Error bounds

KW - Fixed-point iterations

KW - Non-expansive maps

KW - Optimal transport metrics

UR - http://www.scopus.com/inward/record.url?scp=85135991310&partnerID=8YFLogxK

U2 - 10.23952/asvao.4.2022.3.04

DO - 10.23952/asvao.4.2022.3.04

M3 - Article

AN - SCOPUS:85135991310

SN - 2562-7775

VL - 4

SP - 293

EP - 310

JO - Applied Set-Valued Analysis and Optimization

JF - Applied Set-Valued Analysis and Optimization

IS - 3

ER -

UNIVERSAL BOUNDS FOR FIXED POINT ITERATIONS VIA OPTIMAL TRANSPORT METRICS

Abstract

Keywords

Access to Document

Fingerprint

Cite this