An alternating direction method with continuation for nonconvex low rank minimization (Q257130): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10915-015-0045-0 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Eigentaste / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PROPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LMaFit / 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.1007/s10915-015-0045-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W317954863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / 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: Exact matrix completion via convex optimization / 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: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / 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: An implementable proximal point algorithmic framework for nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3161693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating direction method for linear‐constrained matrix nuclear norm minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization / 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: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reweighted nuclear norm minimization algorithm for low rank matrix recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction method for covariance selection models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the statistical model identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction methods for classical and ptychographic phase retrieval / 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 / DOI
 
Property / DOI: 10.1007/S10915-015-0045-0 / rank
 
Normal rank

Latest revision as of 12:46, 9 December 2024

scientific article
Language Label Description Also known as
English
An alternating direction method with continuation for nonconvex low rank minimization
scientific article

    Statements

    An alternating direction method with continuation for nonconvex low rank minimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2016
    0 references
    The authors present a nonconvex model of recovering low-rank matrices from the noisy measurement. The problem is formulated as a nonconvex regularized least squares optimization problem. An alternating direction method with a continuation technique is proposed. Under mild assumptions, the convergence behavior of the alternating direction method is proved. Some numerical experiments are given.
    0 references
    0 references
    low rank minimization
    0 references
    alternating direction method
    0 references
    minimax concave penalty function
    0 references
    recovering low-rank matrices
    0 references
    least squares optimization problem
    0 references
    convergence
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers