# Linear convergence of distributed Dykstra's algorithm for sets under an intersection property

## TL;DR

This paper proves that Dykstra's algorithm converges linearly when applied to intersecting sets under a specific intersection property, extending understanding of its convergence behavior.

## Contribution

It establishes the linear convergence of distributed Dykstra's algorithm under a new intersection condition, broadening its theoretical applicability.

## Key findings

- Proves linear convergence under a new intersection property.
- Extends convergence results for distributed Dykstra's algorithm.
- Provides theoretical foundation for algorithm performance.

## Abstract

We show the linear convergence of Dykstra's algorithm for sets intersecting in a manner slightly stronger than the usual constraint qualifications.