We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

The flow limit of reflect-reflect-relax

Formal Metadata

Title
The flow limit of reflect-reflect-relax
Title of Series
Number of Parts
30
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
In the reflect-reflect-average (RRA) iteration scheme a point is averaged with the product of its reflection in two constraint sets to produce the next point. It was noticed in a recent study of the bit retrieval problem that the relaxed variant of RRA, called RRR, has superior performance in the limit of zero relaxation parameter. In this limit RRR defines a continuous flow (a system of ODEs), where the flow field is formed by the difference of a pair of points on the constraint sets. The flow limit can be implemented very efficiently (event-chain dynamics) when the flow field is piecewise constant, as it is in some NP-hard feasibility problems. I hope to have results for the Latin square completion problem in time for the workshop.