Robust principal component analysis?

DOI10.1145/1970392.1970395zbMath1327.62369OpenAlexW2145962650WikidataQ55921973 ScholiaQ55921973MaRDI QIDQ3016258

No author found.

Publication date: 14 July 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1970392.1970395

zbMATH Keywords

dualityprincipal componentssparsityvideo surveillance\(\ell_1\)-norm minimizationnuclear-norm minimizationlow-rank matricesrobustness vis-a-vis outliers

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Machine vision and scene understanding (68T45)

Related Items (only showing first 100 items - show all)

Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method ⋮ A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity ⋮ Tensor completion by multi-rank via unitary transformation ⋮ Iterative hard thresholding for low CP-rank tensor models ⋮ Matrix completion with column outliers and sparse noise ⋮ Robust PCA for high‐dimensional data based on characteristic transformation ⋮ Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval ⋮ Image Denoising: The Deep Learning Revolution and Beyond—A Survey Paper ⋮ Auto-weighted robust low-rank tensor completion via tensor-train ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion ⋮ An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications ⋮ A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ⋮ Image inpainting using non-convex low rank decomposition and multidirectional search ⋮ Arithmetic circuits, structured matrices and (not so) deep learning ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Smooth over-parameterized solvers for non-smooth structured optimization ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ Robust low-rank tensor completion via new regularized model with approximate SVD ⋮ Approximate Bayesian Algorithm for Tensor Robust Principal Component Analysis ⋮ A generalized non-convex method for robust tensor completion ⋮ Blind image deblurring via the weighted Schatten \(p\)-norm minimization prior ⋮ Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size ⋮ Sparse Reduced Rank Huber Regression in High Dimensions ⋮ Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization ⋮ Mining the factor zoo: estimation of latent factor models with sufficient proxies ⋮ Denoising low-rank discrimination based least squares regression for image classification ⋮ Decomposition of dynamical signals into jumps, oscillatory patterns, and possible outliers ⋮ Robust supervised learning with coordinate gradient descent ⋮ Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization ⋮ A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion ⋮ Reweighted robust and discriminative latent subspace projection for face recognition ⋮ Variational Bayesian inference for CP tensor completion with subspace information ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ Large factor model estimation by nuclear norm plus \(\ell_1\) norm penalization ⋮ Active-learning-driven surrogate modeling for efficient simulation of parametric nonlinear systems ⋮ The decimation scheme for symmetric matrix factorization ⋮ Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ Two-dimensional semi-nonnegative matrix factorization for clustering ⋮ Flexible capped principal component analysis with applications in image recognition ⋮ On the Complexity of Recovering Incidence Matrices ⋮ Accurate and fast matrix factorization for low-rank learning. ⋮ A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices ⋮ Median filtering‐based methods for static background extraction from surveillance video ⋮ An introduction to continuous optimization for imaging ⋮ Large Covariance Estimation by Thresholding Principal Orthogonal Complements ⋮ A New Insight on Augmented Lagrangian Method with Applications in Machine Learning ⋮ Robust nonlinear principal components ⋮ A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ Bayesian inference via projections ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ Quasi-likelihood and/or robust estimation in high dimensions ⋮ Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation ⋮ Comments on: ``Robust estimation of multivariate location and scatter in the presence of cellwise and casewise contamination ⋮ On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Discussion: Latent variable graphical model selection via convex optimization ⋮ Perturbations of CUR Decompositions ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ Discussion of: ``The power of monitoring: how to make the most of a contaminated multivariate sample ⋮ Signal Decomposition Using Masked Proximal Operators ⋮ An analysis of noise folding for low-rank matrix recovery ⋮ On linear convergence of projected gradient method for a class of affine rank minimization problems ⋮ Variational analysis of the Ky Fan \(k\)-norm ⋮ Unbiased risk estimates for matrix estimation in the elliptical case ⋮ CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging ⋮ Robust low-rank data matrix approximations ⋮ Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ The symmetric ADMM with indefinite proximal regularization and its application ⋮ Phaselift is robust to a constant fraction of arbitrary errors ⋮ Relaxed leverage sampling for low-rank matrix completion ⋮ The Moreau envelope based efficient first-order methods for sparse recovery ⋮ Proximal Markov chain Monte Carlo algorithms ⋮ Restricted isometry property of principal component pursuit with reduced linear measurements ⋮ Bayesian sparse covariance decomposition with a graphical structure ⋮ Vector diffusion maps and the connection Laplacian ⋮ A proximal alternating linearization method for nonconvex optimization problems ⋮ Alternating proximal gradient method for convex minimization ⋮ Principle component analysis: robust versions ⋮ Background subtraction with Kronecker-basis-representation based tensor sparsity and \(l_{1,1,2}\) norm ⋮ Robust principal component analysis: a factorization-based approach with linear complexity ⋮ Nonnegative self-representation with a fixed rank constraint for subspace clustering ⋮ Noise-robust image fusion with low-rank sparse decomposition guided by external patch prior ⋮ Block diagonal representation learning for robust subspace clustering ⋮ The degrees of freedom of partly smooth regularizers ⋮ LGSLRR: towards fusing discriminative ordinal local and global structured low-rank representation for image recognition ⋮ Parallel active subspace decomposition for tensor robust principal component analysis ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Spectral operators of matrices ⋮ A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints ⋮ The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing

This page was built for publication: Robust principal component analysis?