DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693): Difference between revisions

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

Revision as of 05:01, 9 July 2024

scientific article
Language Label Description Also known as
English
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
scientific article

    Statements

    DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (English)
    0 references
    17 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    Douglas-Rachford projections
    0 references
    reflections
    0 references
    matrix completion
    0 references
    feasibility problems
    0 references
    protein reconstruction
    0 references
    Hadamard matrices
    0 references
    0 references
    0 references