Douglas-Rachford feasibility methods for matrix completion problems
From MaRDI portal
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.
Recommendations
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Matrix completion via an alternating direction method
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Recent results on Douglas-Rachford methods.
Cites work
- A cyclic Douglas-Rachford iteration scheme
- A cyclic projection algorithm via duality
- A generalized solution of the orthogonal Procrustes problem
- A Singular Value Thresholding Algorithm for Matrix Completion
- Alternating projections in CAT(0) spaces
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Approximation by matrices positive semidefinite on a subspace
- Complex-Valued Matrix Derivatives
- Computing the Polar Decomposition—with Applications
- Convex analysis and nonlinear optimization. Theory and examples.
- Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
- Dykstra's alternating projection algorithm for two sets
- Entropic regularization of the \(\ell _{0}\) function
- Equality relating Euclidean distance cone to positive semidefinite cone
- Exact matrix completion via convex optimization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Global convergence of a non-convex Douglas-Rachford iteration
- Hadamard equivalence via graph isomorphism
- Matrix Analysis
- New restrictions on possible orders of circulant Hadamard matrices
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On skew-Hadamard matrices
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Robust Stopping Criteria for Dykstra's Algorithm
- The Douglas-Rachford algorithm in the absence of convexity
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?
Cited in
(35)- Solving graph coloring problems with the Douglas-Rachford algorithm
- Dynamics of the Douglas-Rachford method for ellipses and p-spheres
- Convergence analysis of processes with valiant projection operators in Hilbert space
- A feasibility approach for constructing combinatorial designs of circulant type
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Circumcentering reflection methods for nonconvex feasibility problems
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Strengthened splitting methods for computing resolvents
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- On the linear convergence of the circumcentered-reflection method
- Geometric search for Hadamard matrices
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Application of projection algorithms to differential equations: boundary value problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Regularity properties of non-negative sparsity sets
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Norm convergence of realistic projection and reflection methods
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Solving nonconvex feasibility problem on a sphere and a closed ball by Douglas-Rachford algorithm
- On the complexity of solving feasibility problems with regularized models
- Douglas–Rachford algorithm for control-constrained minimum-energy control problems
- Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
- Non-separable multidimensional multiresolution wavelets: a Douglas-Rachford approach
- A new projection method for finding the closest point in the intersection of convex sets
This page was built for publication: Douglas-Rachford feasibility methods for matrix completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925693)
