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

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, 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, Decentralized Dictionary Learning Over Time-Varying Digraphs, Principal component analysis for α-stable vectors, Dimension-wise sparse low-rank approximation of a matrix with application to variable selection in high-dimensional integrative analyzes of association, Scalable Low-Rank Representation, Low-Rank and Sparse Dictionary Learning, Low-Rank Transfer Learning, Low-Rank and Sparse Multi-task Learning, Low-Rank Outlier Detection, New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions, An Unbiased Approach to Low Rank Recovery, Gaussian Patch Mixture Model Guided Low-Rank Covariance Matrix Minimization for Image Denoising, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints, Unnamed Item, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, Sparsity Based Nonlocal Image Restoration: An Alternating Optimization Approach, Stable Camera Motion Estimation Using Convex Programming, Robust High-Dimensional Volatility Matrix Estimation for High-Frequency Factor Model, Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints, Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier, Unnamed Item, Directed Principal Component Analysis, Principal component analysis-based control charts using support vector machines for multivariate non-normal distributions, Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements, Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising, Unnamed Item, Principal component analysis: a review and recent developments, A separable surrogate function method for sparse and low-rank matrices decomposition, Super-resolution of point sources via convex programming, Unnamed Item, Nonlocal low-rank and sparse matrix decomposition for spectral CT reconstruction, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Robust Subspace Discovery via Relaxed Rank Minimization, Relations Among Some Low-Rank Subspace Recovery Models, Theoretical and Experimental Analyses of Tensor-Based Regression and Classification, Stochastic Model-Based Minimization of Weakly Convex Functions, Avoiding Optimal Mean ℓ_2,1-Norm Maximization-Based Robust PCA for Reconstruction, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, An unbiased approach to compressed sensing, Non-Negative Sparse Regression and Column Subset Selection with L1 Error, Synthetic Aperture Imaging and Motion Estimation Using Tensor Methods, Robust Estimators in High-Dimensions Without the Computational Intractability, Targeted Random Projection for Prediction From High-Dimensional Features, Unnamed Item, A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION, Unnamed Item, Adapting Regularized Low-Rank Models for Parallel Architectures, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation, Diagonally Dominant Principal Component Analysis, Unnamed Item, Unnamed Item, Liquidity commonality does not imply liquidity resilience commonality: a functional characterisation for ultra-high frequency cross-sectional LOB data, Unnamed Item, Remote sensing image fusion via RPCA and adaptive PCNN in NSST domain, Blind Source Separation with Outliers in Transformed Domains, Unnamed Item, ADMM for multiaffine constrained optimization, Restoration of atmospheric turbulence-distorted images via RPCA and quasiconformal maps, Nonconvex Robust Low-Rank Matrix Recovery, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition, On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation, Modal Principal Component Analysis, Gradient-based Regularization Parameter Selection for Problems With Nonsmooth Penalty Functions, Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration, Infimal Convolution of Oscillation Total Generalized Variation for the Recovery of Images with Structured Texture, Modern regularization methods for inverse problems, Centering Data Improves the Dynamic Mode Decomposition, Graphical Model Selection for Gaussian Conditional Random Fields in the Presence of Latent Variables, A Well-Tempered Landscape for Non-convex Robust Subspace Recovery, Accelerated Alternating Projections for Robust Principal Component Analysis, Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems, A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization, Robust Causal Structure Learning with Some Hidden Variables, Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data, Exact Camera Location Recovery by Least Unsquared Deviations, An alternating minimization method for robust principal component analysis, Consistent Dynamic Mode Decomposition, Unnamed Item, Unnamed Item, Optimization-Based Modal Decomposition for Systems with Multiple Transports, Unnamed Item, An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations, On the Compressive Spectral Method, Approximate survey propagation for statistical inference, Unnamed Item, Perturbation analysis of low-rank matrix stable recovery, Unnamed Item, Estimation of a sparse and spiked covariance matrix, Unnamed Item, A Combination Model of Robust Principal Component Analysis and Multiple Kernel Learning for Cancer Patient Stratification, An $L^1$ Penalty Method for General Obstacle Problems, Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction, A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization, Robust and Scalable Methods for the Dynamic Mode Decomposition, Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion, Low rank matrix recovery with adversarial sparse noise*, 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, Nonsmooth rank-one matrix factorization landscape, Subspace segmentation by dense block and sparse representation, Kronecker-structured covariance models for multiway data, A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming, Compressed sensing of low-rank plus sparse matrices, Detecting approximate replicate components of a high-dimensional random vector with latent structure, Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes, Convex optimization for the planted \(k\)-disjoint-clique problem, Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data, Statistical inference based on robust low-rank data matrix approximation, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, Efficient algorithms for robust and stable principal component pursuit problems, An introduction to a class of matrix cone programming, A modified alternating projection based prediction-correction method for structured variational inequalities, A partially proximal S-ADMM for separable convex optimization with linear constraints, New robust PCA for outliers and heavy sparse noises' detection via affine transformation, the \(L_{\ast, w}\) and \(L_{2,1}\) norms, and spatial weight matrix in high-dimensional images: from the perspective of signal processing, A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization, Outlier detection in networks with missing links, Matrix recipes for hard thresholding methods, Learning with tensors: a framework based on convex optimization and spectral regularization, Convergence of projected Landweber iteration for matrix rank minimization, Robust linear optimization under matrix completion, Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates, Sparse trace norm regularization, Data science, big data and statistics, Robust modifications of U-statistics and applications to covariance estimation problems, Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning, Recovering low-rank and sparse matrix based on the truncated nuclear norm, Low-rank tensor train for tensor robust principal component analysis, Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach, Estimation in High Dimensions: A Geometric Perspective, Low Complexity Regularization of Linear Inverse Problems, Pairwise constraint propagation via low-rank matrix recovery, Removing mixed noise in low rank textures by convex optimization, Robust principal component pursuit via inexact alternating minimization on matrix manifolds, A combinatorial approach to \(L_1\)-matrix factorization, Phase retrieval from coded diffraction patterns, Sparse subspace clustering for data with missing entries and high-rank matrix completion, F-norm distance metric based robust 2DPCA and face recognition, Certifiably optimal sparse principal component analysis, A non-convex tensor rank approximation for tensor completion, Multiresolution Dynamic Mode Decomposition, Majorized proximal alternating imputation for regularized rank constrained matrix completion, A new smoothed L0 regularization approach for sparse signal recovery, Sharp oracle inequalities for low-complexity priors, Low-dose spectral CT reconstruction using image gradient \(\ell_0\)-norm and tensor dictionary, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Low-Rank Approximation and Completion of Positive Tensors, Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods, Robust Low-Rank Matrix Completion by Riemannian Optimization, Mixture augmented Lagrange multiplier method for tensor recovery and its applications, Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization, Active Subspace: Toward Scalable Low-Rank Learning, An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, On visual periodicity estimation using singular value decomposition, Semi-sparse PCA, A modified primal-dual method with applications to some sparse recovery problems, Optimization of the regularization in background and foreground modeling, ROP: matrix recovery via rank-one projections, Similarity preserving low-rank representation for enhanced data representation and effective subspace learning, Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems, An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence, Forward–backward-based descent methods for composite variational inequalities, A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint, Eigen-analysis of nonlinear PCA with polynomial kernels, Mirror Prox algorithm for multi-term composite minimization and semi-separable problems, Robust computation of linear models by convex relaxation, Robust and computationally feasible community detection in the presence of arbitrary outlier nodes, Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning, A partial splitting augmented Lagrangian method for low patch-rank image decomposition, A novel robust principal component analysis method for image and video processing., Multifocus image fusion by combining with mixed-order structure tensors and multiscale neighborhood, Incremental principal component pursuit for video background modeling, Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming, Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems, Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery, An efficient algorithm for batch images alignment with adaptive rank-correction term, Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter, Adaptive shrinkage of singular values, Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components, Geometric inference for general high-dimensional linear inverse problems, An algorithm twisted from generalized ADMM for multi-block separable convex minimization models, A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis, Modeling and performance evaluation of stealthy false data injection attacks on smart grid in the presence of corrupted measurements, On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models, Using shapes correlation for active contour segmentation of uterine fibroid ultrasound images in computer-aided therapy, Sharp MSE bounds for proximal denoising, An improved robust ADMM algorithm for quantum state tomography, Manifold adaptive kernelized low-rank representation for semisupervised image classification, On the incommensurability phenomenon, Applications of gauge duality in robust principal component analysis and semidefinite programming, Bayesian robust principal component analysis with structured sparse component, Asymptotic performance of PCA for high-dimensional heteroscedastic data, Towards enhancing stacked extreme learning machine with sparse autoencoder by correntropy, Stable analysis of compressive principal component pursuit, Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures, Two modified augmented Lagrange multiplier algorithms for Toeplitz matrix compressive recovery, Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit, Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning, Multi-view low-rank dictionary learning for image classification, A partially isochronous splitting algorithm for three-block separable convex minimization problems, Robust subspace segmentation via nonconvex low rank representation, Variational Bayesian sparse additive matrix factorization, Fast alternating linearization methods for minimizing the sum of two convex functions, A patch-based low-rank tensor approximation model for multiframe image denoising, Lower bounds for the low-rank matrix approximation, Learning Markov random walks for robust subspace clustering and estimation, Learning a factor model via regularized PCA, Sharp recovery bounds for convex demixing, with applications, Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation, Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time, Split Bregman method for large scale fused Lasso, Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity, Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization, Painless breakups -- efficient demixing of low rank matrices, Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions, Improve robustness of sparse PCA by \(L_{1}\)-norm maximization, A generalized robust minimization framework for low-rank matrix recovery, An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion, Robust missing traffic flow imputation considering nonnegativity and road capacity, Low-rank representation-based object tracking using multitask feature learning with joint sparsity, An implementable first-order primal-dual algorithm for structured convex optimization, Fast computation of robust subspace estimators, Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization, Multi-stage convex relaxation method for low-rank and sparse matrix separation problem, \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers, Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure, Alternating direction method of multipliers for generalized low-rank tensor recovery, Semi-supervised classification based on low rank representation, Corruption-tolerant bandit learning, An alternating direction method with increasing penalty for stable principal component pursuit, Extreme point inequalities and geometry of the rank sparsity ball, Level-set methods for convex optimization, Robust covariance estimation for approximate factor models, Factor GARCH-Itô models for high-frequency data with application to large volatility matrix prediction, Robust graph regularized nonnegative matrix factorization for clustering, Sparse plus low rank network identification: a nonparametric approach, Convergent prediction-correction-based ADMM for multi-block separable convex programming, Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging, Max-norm optimization for robust matrix recovery, Concentration inequalities for matrix martingales in continuous time, Robust bilinear factorization with missing and grossly corrupted observations, Robust matrix completion, Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss, Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset, Matrix completion under interval uncertainty, An extragradient-based alternating direction method for convex minimization, An alternating direction algorithm for matrix completion with nonnegative factors, Cauchy robust principal component analysis with applications to high-deimensional data sets, Characterization of the equivalence of robustification and regularization in linear and matrix regression, Sparse Principal Component Analysis via Variable Projection, Geometric median and robust estimation in Banach spaces, Robust group lasso: model and recoverability, Sparse + low-energy decomposition for viscous conservation laws, Latent variable graphical model selection via convex optimization, Visualizing data through curvilinear representations of matrices, Flexible low-rank statistical modeling with missing data and side information, Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem, Robust visual tracking via consistent low-rank sparse learning, Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization, Collaborative linear coding for robust image classification, Fast community detection by SCORE, Main effects and interactions in mixed and incomplete data frames, Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction, A simple prior-free method for non-rigid structure-from-motion factorization, Learning non-parametric basis independent models from point queries via low-rank methods, Fast global convergence of gradient methods for high-dimensional statistical recovery, Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, An alternating direction method with continuation for nonconvex low rank minimization, A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement, Data-driven modeling of two-dimensional detonation wave fronts, Alternating DC algorithm for partial DC programming problems, Deformable groupwise image registration using low-rank and sparse decomposition, Joint reconstruction and low-rank decomposition for dynamic inverse problems, Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes, Adaptive estimation in multivariate response regression with hidden variables, A survey on some recent developments of alternating direction method of multipliers, Regularized high dimension low tubal-rank tensor regression, Bias versus non-convexity in compressed sensing, An efficient algorithm for computing the approximate t-URV and its applications, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Estimating shape parameters of piecewise linear-quadratic problems, Detection of two-way outliers in multivariate data and application to cheating detection in educational tests, Low rank matrix recovery with impulsive noise, On the rotational invariant \(L_1\)-norm PCA, Complex best \(r\)-term approximations almost always exist in finite dimensions, Enhanced image approximation using shifted rank-1 reconstruction, Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search, Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization, Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data, The convex geometry of linear inverse problems, Low-rank and sparse embedding for dimensionality reduction, Unsupervised robust discriminative manifold embedding with self-expressiveness, Bayesian rank penalization, Adaptive robust principal component analysis, TILT: transform invariant low-rank textures, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, An improved total variation regularized RPCA for moving object detection with dynamic background, Robust PCA using nonconvex rank approximation and sparse regularizer, Bayesian robust principal component analysis with adaptive singular value penalty, Compressed sensing and matrix completion with constant proportion of corruptions, Weighted nuclear norm minimization and its applications to low level vision, Dynamic behavior analysis via structured rank minimization, Compressive total variation for image reconstruction and restoration, Discussion: Latent variable graphical model selection via convex optimization, Rejoinder: Latent variable graphical model selection via convex optimization, Entrywise eigenvector analysis of random matrices with low expected rank, Statistical and computational limits for sparse matrix detection, Euler principal component analysis, Visual tracking via subspace learning: a discriminative approach, A multi-objective memetic algorithm for low rank and sparse matrix decomposition, An ADM-based splitting method for separable convex programming, Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis, Joint and individual variation explained (JIVE) for integrated analysis of multiple data types, Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations, Adaptive estimation in structured factor models with applications to overlapping clustering, Background subtraction using adaptive singular value decomposition, Parameterized low-rank binary matrix approximation, Robust principal component analysis using facial reduction, Nonconvex optimization for robust tensor completion from grossly sparse observations, New robust regularized shrinkage regression for high-dimensional image recovery and alignment via affine transformation and Tikhonov regularization, Nonconvex tensor rank minimization and its applications to tensor recovery, A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit, Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems, Linear embedding by joint robust discriminant analysis and inter-class sparsity, Robust low-rank matrix estimation, Stable separation and super-resolution of mixture models, Robust tracking via locally structured representation, Convex low rank approximation, Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries, A proximal fully parallel splitting method for stable principal component pursuit, Variational models for joint subsampling and reconstruction of turbulence-degraded images, On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors, Low-rank and sparse matrices fitting algorithm for low-rank representation, Comparisons of several algorithms for Toeplitz matrix recovery, Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1], Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity, Online optimization for max-norm regularization, Traditional and recent approaches in background modeling for foreground detection: an overview, On the robust PCA and Weiszfeld's algorithm, A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming, Estimation of the parameters of a weighted nuclear norm model and its application in image denoising, On factor models with random missing: EM estimation, inference, and cross validation, Fast algorithms for robust principal component analysis with an upper bound on the rank, Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory, Principal component analysis: a generalized Gini approach, Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm, Low-rank matrix recovery via regularized nuclear norm minimization, Robust high-dimensional factor models with applications to statistical machine learning, ROML: a robust feature correspondence approach for matching objects in a set of images, A parameterized proximal point algorithm for separable convex optimization, Matrix optimization based Euclidean embedding with outliers, Decomposition of longitudinal deformations via Beltrami descriptors, ORCA: outlier detection and robust clustering for attributed graphs, The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Two-stage image denoising via an enhanced low-rank prior, Inpainting via sparse recovery with directional constraints, A comprehensive and systematic look up into deep learning based object detection techniques: a review, Moving objects detection with a moving camera: a comprehensive review, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Link prediction techniques, applications, and performance: a survey, An adaptation for iterative structured matrix completion, Unified discrete-time factor stochastic volatility and continuous-time Itô models for combining inference based on low-frequency and high-frequency, A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm, Robust tensor recovery with nonconvex and nonsmooth regularization, Stable recovery of entangled weights: towards robust identification of deep neural networks from minimal samples, An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems, Accelerating variance-reduced stochastic gradient methods