Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres

DOI10.1007/S11228-017-0457-0MaRDI QIDQ6278578arXivFDO

Authors Jonathan M. Borwein, Scott B. Lindstrom, Brailey Sims, Anna Schneider, Matthew P. Skerritt

Publication date 13 October 2016

Full work available at URL https://doi.org/10.1007/S11228-017-0457-0

Nonconvex programming, global optimization (90C26) Nonlinear operators and their properties (47H99) Numerical aspects of recurrence relations (65Q30)

arXiv classification

math.FA

Abstract: We expand upon previous work that examined behavior of the iterated Douglas-Rachford method for a line and a circle by considering two generalizations: that of a line and an ellipse and that of a line together with a

p

-sphere. With computer assistance we discover a beautiful geometry that illustrates phenomena which may affect the behavior of the iterates by slowing or inhibiting convergence for feasible cases. We prove local convergence near feasible points, and---seeking a better understanding of the behavior---we employ parallelization in order to study behavior graphically. Motivated by the computer-assisted discoveries, we prove a result about behavior of the method in infeasible cases.

This page was built for publication: Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278578)