Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem

DOI10.1016/j.apnum.2023.05.003zbMath1527.90165MaRDI QIDQ6169244

No author found.

Publication date: 11 July 2023

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

smoothing approximationconvex nonsmooth loss functioninertial proximal gradient algorithmmatrix rank regularization problem

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fixed point and Bregman iterative methods for matrix rank minimization
• Smoothing methods for nonsmooth, nonconvex minimization
• Convex multi-task feature learning
• Introductory lectures on convex optimization. A basic course.
• A simplified view of first order methods for optimization
• \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
• A smoothing proximal gradient algorithm for matrix rank minimization problem
• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Nonsmooth analysis of singular values. II: Applications
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
• Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
• Robust PCA via Outlier Pursuit
• Some methods of speeding up the convergence of iteration methods

This page was built for publication: Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem