DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS

DOI10.1017/S1446181114000145zbMath1297.90182arXiv1308.4243OpenAlexW3103316059MaRDI QIDQ2925693

Jonathan M. Borwein, Matthew K. Tam, Francisco J. Aragón Artacho

Publication date: 17 October 2014

Published in: The ANZIAM Journal (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionHadamard matricesreflectionsfeasibility problemsDouglas-Rachford projectionsprotein reconstruction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

On the complexity of solving feasibility problems with regularized models ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Anderson acceleration of the alternating projections method for computing the nearest correlation matrix ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres ⋮ Regularity properties of non-negative sparsity sets ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ On the linear convergence of the circumcentered-reflection method ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Geometric search for Hadamard matrices ⋮ An envelope for Davis-Yin splitting and strict saddle-point avoidance ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Douglas–Rachford algorithm for control-constrained minimum-energy control problems ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Convergence analysis of processes with valiant projection operators in Hilbert space ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Strengthened splitting methods for computing resolvents ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A feasibility approach for constructing combinatorial designs of circulant type ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Norm convergence of realistic projection and reflection methods ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS ⋮ On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization ⋮ Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• New restrictions on possible orders of circulant Hadamard matrices
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Alternating projections in CAT(0) spaces
• Convex analysis and nonlinear optimization. Theory and examples.
• Equality relating Euclidean distance cone to positive semidefinite cone
• On skew-Hadamard matrices
• Approximation by matrices positive semidefinite on a subspace
• A cyclic projection algorithm via duality
• Hadamard equivalence via graph isomorphism
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• A cyclic Douglas-Rachford iteration scheme
• Global convergence of a non-convex Douglas-Rachford iteration
• A generalized solution of the orthogonal Procrustes problem
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Exact matrix completion via convex optimization
• Entropic Regularization of the ℓ 0 Function
• The Douglas–Rachford Algorithm in the Absence of Convexity
• A Singular Value Thresholding Algorithm for Matrix Completion
• Complex-Valued Matrix Derivatives
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Matrix Analysis
• Computing the Polar Decomposition—with Applications
• Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility
• On Projection Algorithms for Solving Convex Feasibility Problems
• Robust Stopping Criteria for Dykstra's Algorithm
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?