4.7 Article

Low rank matrix recovery with impulsive noise

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

A smoothing proximal gradient algorithm for matrix rank minimization problem

Quan Yu et al.

Summary: This paper studies the low-rank matrix minimization problem and introduces a continuous relaxation model and the concept of lifted stationary points. By proposing a smoothing proximal gradient algorithm, lifted stationary points of the continuous relaxation model are successfully found, and the effectiveness of the algorithm is proved.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2022)

Article Mathematics, Applied

An accelerated IRNN-Iteratively Reweighted Nuclear Norm algorithm for nonconvex nonsmooth low-rank minimization problems

Duy Nhat Phan et al.

Summary: This paper presents an algorithm inspired by Nesterov's acceleration technique to accelerate an iteratively reweighted nuclear norm algorithm for low-rank minimization problems, ensuring that every limit point is a critical point. The algorithm iteratively computes the proximal operator of a reweighted nuclear norm by performing the SVD of a smaller matrix instead of the full SVD, distinguishing it from other algorithms that require expensive computations for nonconvex nonsmooth composite functions.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2021)

Article Mathematics, Applied

A SMOOTHING PROXIMAL GRADIENT ALGORITHM FOR NONSMOOTH CONVEX REGRESSION WITH CARDINALITY PENALTY

Wei Bian et al.

SIAM JOURNAL ON NUMERICAL ANALYSIS (2020)

Article Mathematics, Applied

Iterative hard thresholding for low-rank recovery from rank-one projections

Simon Foucart et al.

LINEAR ALGEBRA AND ITS APPLICATIONS (2019)

Article Computer Science, Artificial Intelligence

Recovering low-rank and sparse matrix based on the truncated nuclear norm

Feilong Cao et al.

NEURAL NETWORKS (2017)

Article Computer Science, Artificial Intelligence

Truncated l1-2 Models for Sparse Recovery and Rank Minimization

Tian-Hui Ma et al.

SIAM JOURNAL ON IMAGING SCIENCES (2017)

Article Computer Science, Information Systems

Restricted Isometry Property for General p-Norms

Zeyuan Allen-Zhu et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2016)

Article Operations Research & Management Science

Primal and dual alternating direction algorithms for l1-l1-norm minimization problems in compressive sensing

Yunhai Xiao et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2013)

Article Computer Science, Information Systems

Restricted p-Isometry Properties of Nonconvex Matrix Recovery

Min Zhang et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2013)

Article Statistics & Probability

The L1 penalized LAD estimator for high dimensional linear regression

Lie Wang

JOURNAL OF MULTIVARIATE ANALYSIS (2013)

Article Computer Science, Software Engineering

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

Zaiwen Wen et al.

MATHEMATICAL PROGRAMMING COMPUTATION (2012)

Article Computer Science, Hardware & Architecture

Robust Principal Component Analysis?

Emmanuel J. Candes et al.

JOURNAL OF THE ACM (2011)

Article Mathematics, Applied

ALTERNATING DIRECTION ALGORITHMS FOR l(1)-PROBLEMS IN COMPRESSIVE SENSING

Junfeng Yang et al.

SIAM JOURNAL ON SCIENTIFIC COMPUTING (2011)

Article Computer Science, Artificial Intelligence

Convex multi-task feature learning

Andreas Argyriou et al.

MACHINE LEARNING (2008)