An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
type: Item
instance of: scholarly article
title: An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
zbMATH Open document ID: 1469.90114
author: Duy Nhat Phan
author: Thuy Ngoc Nguyen
published in: Journal of Computational and Applied Mathematics
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7355009
zbMATH Keywords: low-rank minimization
zbMATH Keywords: iteratively reweighted algorithm
zbMATH Keywords: Nesterov's acceleration
zbMATH Keywords: proximal gradient algorithm
zbMATH Keywords: matrix completion
zbMATH Keywords: subspace clustering
MaRDI profile type: Publication
full work available at URL: j.cam.2021.113602
OpenAlex ID: W3152703571
cites work: Exact matrix completion via convex optimization
cites work: Convex multi-task feature learning
cites work: Q3161693
cites work: A reweighted nuclear norm minimization algorithm for low rank matrix recovery
cites work: On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
cites work: Composite Optimization by Nonconvex Majorization-Minimization
cites work: Non-smooth non-convex Bregman minimization: unification and new algorithms
cites work: Iteratively reweighted \(\ell _1\) algorithms with extrapolation
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3320132
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Reduced rank regression via adaptive nuclear norm penalization
cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: A proximal difference-of-convex algorithm with extrapolation
cites work: Adaptive restart for accelerated gradient schemes
DOI: 10.1016/J.CAM.2021.113602
description: scientific article; zbMATH DE number 7355009