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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Hans Benker / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C26 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6555600 / rank
 
Normal rank
Property / zbMATH Keywords
 
low rank minimization
Property / zbMATH Keywords: low rank minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
alternating direction method
Property / zbMATH Keywords: alternating direction method / rank
 
Normal rank
Property / zbMATH Keywords
 
minimax concave penalty function
Property / zbMATH Keywords: minimax concave penalty function / rank
 
Normal rank
Property / zbMATH Keywords
 
recovering low-rank matrices
Property / zbMATH Keywords: recovering low-rank matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
least squares optimization problem
Property / zbMATH Keywords: least squares optimization problem / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence
Property / zbMATH Keywords: convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiment
Property / zbMATH Keywords: numerical experiment / rank
 
Normal rank

Revision as of 13:35, 27 June 2023

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
    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