An algorithm for affine rank minimization problem

DOI10.16441/J.CNKI.HDXB.20190023MaRDI QIDQ4996845zbMATH OpenFDO

Authors Zhanliang Wang, Liu Xinguo

Publication date 1 July 2021

Full work available at URL https://doi.org/10.16441/J.CNKI.HDXB.20190023

zbMATH Keywords

nuclear normproximal operatorlow-rank matrixrank functionrelaxation model

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Low-rank matrix recovery via iteratively reweighted least squares minimization
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Affine matrix rank minimization problem via non-convex fraction function penalty
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery

Cited in

(8)

• A smoothing proximal gradient algorithm for matrix rank minimization problem
• Affine matrix rank minimization problem via non-convex fraction function penalty
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
• Stochastic variance reduced gradient for affine rank minimization problem
• Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem
• On linear convergence of projected gradient method for a class of affine rank minimization problems
• Rank minimization with applications to image noise removal
• Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints

This page was built for publication: An algorithm for affine rank minimization problem

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