Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry

نویسندگان

چکیده

Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive nonexpansive fixed point iterations new tool called the scaled relative graph (SRG). The SRG provides correspondence between nonlinear operators subsets 2D plane. Under framework, argument plane becomes rigorous proof convergence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrices and graphs in Euclidean geometry

Some examples of the interplay between matrix theory, graph theory and n-dimensional Euclidean geometry are presented. In particular, qualitative properties of interior angles in simplices are completely characterized. For right simplices, a relationship between the tree of legs and the circumscribed Steiner ellipsoids is proved.

متن کامل

Ela Matrices and Graphs in Euclidean Geometry

Some examples of the interplay between matrix theory, graph theory and n-dimensional Euclidean geometry are presented. In particular, qualitative properties of interior angles in simplices are completely characterized. For right simplices, a relationship between the tree of legs and the circumscribed Steiner ellipsoids is proved.

متن کامل

Euclidean Geometry before non-Euclidean Geometry

In [3], in my argument for the primacy of Euclidean geometry on the basis of rigid motions and the existence of similar but non-congruent triangles, I wrote the following: A: “The mobility of rigid objects is now recognized as one of the things every normal human child learns in infancy, and this learning appears to be part of our biological progaramming.” B. “. . . we are all used to thinking ...

متن کامل

Solving Monotone Inclusions via Compositions of Nonexpansive Averaged Operators

A unified fixed point theoretic framework is proposed to investigate the asymptotic behavior of algorithms for finding solutions to monotone inclusion problems. The basic iterative scheme under consideration involves nonstationary compositions of perturbed averaged nonexpansive operators. The analysis covers proximal methods for common zero problems as well as various splitting methods for find...

متن کامل

Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs

The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the sum of the n distances between matched pairs is minimized. The graph theoretic version of this problem has been extensively studied since the pioneering work of Edmonds. The best time bound known for MEWM is O(n 2:5 (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2021

ISSN: ['0025-5610', '1436-4646']

DOI: https://doi.org/10.1007/s10107-021-01639-w