DeepAI AI Chat
Log In Sign Up

Nawrotzki's Algorithm for the Countable Splitting Lemma, Constructively

by   Ana Sokolova, et al.
TU Wien
Universitätsbibliothek Salzburg

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that each term of the iteratively built approximating sequence as well as the error between the approximants and the solution is computable with finitely many algebraic operations.


page 1

page 2

page 3

page 4


Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics

It is well known that the R, the set of real numbers, is an abstract set...

Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex f...

Conservation laws with discontinuous flux function on networks: a splitting algorithm

In this article, we present an extension of the splitting algorithm prop...

Parallel efficiency of monolithic and fixed-strain solution strategies for poroelasticity problems

Poroelasticity is an example of coupled processes which are crucial for ...

Privacy-preserving Data Splitting: A Combinatorial Approach

Privacy-preserving data splitting is a technique that aims to protect da...

Operator Splitting for Adaptive Radiation Therapy with Nonlinear Health Dynamics

We present an optimization-based approach to radiation treatment plannin...

Computing Real Numbers with Large-Population Protocols Having a Continuum of Equilibria

Bournez, Fraigniaud, and Koegler defined a number in [0,1] as computable...