An alternating minimization method for matrix completion problems (Q2182816): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127232270, #quickstatements; #temporary_batch_1722543333430
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LMaFit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FTVd / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/dcdss.2020103 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971384615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative robust uncertainty principles and optimally sparse decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Simple Shrinkage Is Still Relevant for Redundant Representations? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementable proximal point algorithmic framework for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point and Bregman iterative methods for matrix rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4908856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127232270 / rank
 
Normal rank

Latest revision as of 21:18, 1 August 2024

scientific article
Language Label Description Also known as
English
An alternating minimization method for matrix completion problems
scientific article

    Statements

    An alternating minimization method for matrix completion problems (English)
    0 references
    0 references
    0 references
    26 May 2020
    0 references
    matrix completion
    0 references
    symmetric low rank product minimization
    0 references
    singular value decomposition
    0 references
    alternating minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references