An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems

DOI10.1016/J.CAM.2021.113602MaRDI QIDQ2029679zbMATH OpenOpenAlexFDO

Authors Duy Nhat Phan, Thuy Ngoc Nguyen

Publication date 3 June 2021

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2021.113602

zbMATH Keywords

iteratively reweighted algorithmlow-rank minimizationmatrix completionNesterov's accelerationproximal gradient algorithmsubspace clustering

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Recommendations

• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• Low-rank factorization for rank minimization with nonconvex regularizers
• scientific article; zbMATH DE number 6276219
• Low-rank matrix recovery via iteratively reweighted least squares minimization

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A proximal difference-of-convex algorithm with extrapolation
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• Adaptive restart for accelerated gradient schemes
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Composite optimization by nonconvex majorization-minimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex multi-task feature learning
• Exact matrix completion via convex optimization
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation
• Non-smooth non-convex Bregman minimization: unification and new algorithms
• On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Reduced rank regression via adaptive nuclear norm penalization

Cited in

(6)

• Low-rank factorization for rank minimization with nonconvex regularizers
• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
• Low rank matrix recovery with impulsive noise
• Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization
• A proximal alternative directional method of multipliers for a class of low rank matrix recovery problems
• Efficient active manifold identification via accelerated iteratively reweighted nuclear norm minimization

This page was built for publication: An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029679)