Dynamics of the Douglas-Rachford method for ellipses and p-spheres

DOI10.1007/S11228-017-0457-0MaRDI QIDQ1653333zbMATH OpenOpenAlexFDO

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

Publication date 3 August 2018

Published in Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.03975

zbMATH Keywords

discrete dynamical systemsiterative methodsfeasibilityDouglas-Rachfordprojection algorithms

Mathematics Subject Classification ID

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

Recommendations

• The Douglas-Rachford algorithm for the case of the sphere and the line
• Dynamic relaxation for elliptic problems
• An ellipsoid algorithm for the computation of fixed points
• A family of ellipse methods for solving non-linear equations
• scientific article; zbMATH DE number 802413
• scientific article; zbMATH DE number 1531780
• Numerical exploration of the dynamics of self-adjoint S-type Riemann ellipsoids
• Circumscribed ellipsoid algorithm for fixed-point problems
• Ellipsoidal methods for dynamics and control. I
• Galerkin approximation for elliptic PDEs on spheres

Cites work

• scientific article; zbMATH DE number 1745557 (Why is no real title available?)
• Convex analysis and monotone operator theory in Hilbert spaces
• Douglas-Rachford feasibility methods for matrix completion problems
• Dynamics of the Douglas-Rachford method for ellipses and p-spheres
• Functional analysis, Sobolev spaces and partial differential equations
• Global convergence of a non-convex Douglas-Rachford iteration
• On the Douglas-Rachford algorithm
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The Douglas-Rachford algorithm for the case of the sphere and the line
• The Douglas-Rachford algorithm in the absence of convexity
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited in

(15)

• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
• Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Application of projection algorithms to differential equations: boundary value problems
• Comparing averaged relaxed cutters and projection methods: theory and examples
• Circumcentering reflection methods for nonconvex feasibility problems
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres
• Variational analysis down under open problem session
• Dynamics of the Douglas-Rachford method for ellipses and p-spheres
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration
• \textit{Ab initio} phasing of the diffraction of crystals with translational disorder
• Shape transform phasing of edgy nanocrystals
• Some reflections on the Mori-Tanaka and Ponte Castañeda-Willis methods with randomly oriented ellipsoidal inclusions

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 Q1653333)