About uniform regularity of collections of sets

TL;DR

This paper investigates the uniform regularity of collections of sets using primal and dual constants, which are crucial for understanding the convergence rates of projection algorithms in feasibility problems.

Contribution

It introduces new primal and dual characterizing constants for uniform regularity, enhancing the understanding of convergence behavior in set collection problems.

Findings

New primal and dual constants for uniform regularity

Improved understanding of convergence rates of projection algorithms

Enhanced criteria for feasibility problem solutions

Abstract

We further investigate the uniform regularity property of collections of sets via primal and dual characterizing constants. These constants play an important role in determining convergence rates of projection algorithms for solving feasibility problems.