Douglas-Rachford Feasibility Methods for Matrix Completion Problems

Abstract

In this paper we give general recommendations for successful application of the Douglas-Rachford reflection method to convex and non-convex real matrix-completion problems. These guidelines are demonstrated by various illustrative examples.

30 pages, 4 figures, 3 tables

References in corpus (1)

• Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility

Cited by in corpus (8)

• Global Behavior of the Douglas-Rachford Method for a Nonconvex Feasibility Problem
• On the linear convergence of the circumcentered-reflection method
• A new projection method for finding the closest point in the intersection of convex sets
• Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres
• Reflection methods for inverse problems with application to protein conformation determination
• Regularity Properties of Non-Negative Sparsity Sets
• Douglas--Rachford Splitting and ADMM for Pathological Convex Optimization
• A feasibility approach for constructing combinatorial designs of circulant type