Decomposition into low-rank plus additive matrices for background/foreground separation: A review for a comparative evaluation with a large-scale dataset

T Bouwmans, A Sobral, S Javed, SK Jung… - Computer Science …, 2017 - Elsevier
Background/foreground separation is the first step in video surveillance system to detect
moving objects. Recent research on problem formulations based on decomposition into low …

Robust PCA via principal component pursuit: A review for a comparative evaluation in video surveillance

T Bouwmans, EH Zahzah - Computer Vision and Image Understanding, 2014 - Elsevier
Foreground detection is the first step in video surveillance system to detect moving objects.
Recent research on subspace estimation by sparse representation and rank minimization …

Global convergence of ADMM in nonconvex nonsmooth optimization

Y Wang, W Yin, J Zeng - Journal of Scientific Computing, 2019 - Springer
In this paper, we analyze the convergence of the alternating direction method of multipliers
(ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ϕ (x_0 …

Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems

M Hong, ZQ Luo, M Razaviyayn - SIAM Journal on Optimization, 2016 - SIAM
The alternating direction method of multipliers (ADMM) is widely used to solve large-scale
linearly constrained optimization problems, convex or nonconvex, in many engineering …

Tensor factorization for low-rank tensor completion

P Zhou, C Lu, Z Lin, C Zhang - IEEE Transactions on Image …, 2017 - ieeexplore.ieee.org
Recently, a tensor nuclear norm (TNN) based method was proposed to solve the tensor
completion problem, which has achieved state-of-the-art performance on image and video …

Unified embedding alignment with missing views inferring for incomplete multi-view clustering

J Wen, Z Zhang, Y Xu, B Zhang, L Fei, H Liu - Proceedings of the AAAI …, 2019 - aaai.org
Multi-view clustering aims to partition data collected from diverse sources based on the
assumption that all views are complete. However, such prior assumption is hardly satisfied …

Detecting false data injection attacks on power grid by sparse optimization

L Liu, M Esmalifalak, Q Ding… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
State estimation in electric power grid is vulnerable to false data injection attacks, and
diagnosing such kind of malicious attacks has significant impacts on ensuring reliable …

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

Z Wen, W Yin, Y Zhang - Mathematical Programming Computation, 2012 - Springer
The matrix completion problem is to recover a low-rank matrix from a subset of its entries.
The main solution strategy for this problem has been based on nuclear-norm minimization …

Design of optimal sparse feedback gains via the alternating direction method of multipliers

F Lin, M Fardad, MR Jovanović - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
We design sparse and block sparse feedback gains that minimize the variance amplification
(ie, the H 2 norm) of distributed systems. Our approach consists of two steps. First, we …

Robust low-rank tensor recovery: Models and algorithms

D Goldfarb, Z Qin - SIAM Journal on Matrix Analysis and Applications, 2014 - SIAM
Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for
multilinear data analysis against outliers, gross corruptions, and missing values and has a …