# Algorithms Based on Unions of Nonexpansive Maps

Source: [Algorithms Based on Unions of Nonexpansive Maps](<https://www.sota2.com/research/paper/68fa55111e209131ce990bea>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T13:21:38.686Z

Authors: Matthew K. Tam

Published: 2017-10-23T12:14:21.000Z

## Abstract

In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be expressed as a finite union of values of single-valued paracontracting operators. Our main result, which shows that the associated fixed point iteration is locally convergent around strong fixed points, generalises a theorem due to Bauschke and Noll (2014).

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1710.08227>)

[PDF](<https://arxiv.org/pdf/1710.08227.pdf>)
