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 …

On the global linear convergence of the ADMM with multiblock variables

T Lin, S Ma, S Zhang - SIAM Journal on Optimization, 2015 - SIAM
The alternating direction method of multipliers (ADMM) has been widely used for solving
structured convex optimization problems. In particular, the ADMM can solve convex …

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

B Jiang, T Lin, S Ma, S Zhang - Computational Optimization and …, 2019 - Springer
Nonconvex and nonsmooth optimization problems are frequently encountered in much of
statistics, business, science and engineering, but they are not yet widely recognized as a …

Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators

P Latafat, P Patrinos - Computational Optimization and Applications, 2017 - Springer
In this work we propose a new splitting technique, namely Asymmetric Forward–Backward–
Adjoint splitting, for solving monotone inclusions involving three terms, a maximally …

On the sublinear convergence rate of multi-block ADMM

TY Lin, SQ Ma, SZ Zhang - Journal of the Operations Research Society of …, 2015 - Springer
The alternating direction method of multipliers (ADMM) is widely used in solving structured
convex optimization problems. Despite its success in practice, the convergence of the …

Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization

M Yashtini - Journal of Global Optimization, 2022 - Springer
In this paper, we consider a proximal linearized alternating direction method of multipliers, or
PL-ADMM, for solving linearly constrained nonconvex and possibly nonsmooth optimization …

[HTML][HTML] Efficient learning rate adaptation based on hierarchical optimization approach

GS Na - Neural Networks, 2022 - Elsevier
This paper proposes a new hierarchical approach to learning rate adaptation in gradient
methods, called learning rate optimization (LRO). LRO formulates the learning rate adaption …

Transactive energy market operation through coordinated TSO-DSOs-DERs interactions

MH Ullah, JD Park - IEEE Transactions on Power Systems, 2022 - ieeexplore.ieee.org
This paper proposes a new decentralized transactive energy (TE) market strategy
integrating wholesale and local energy markets through coordinated interactions between …

Superpixel-guided discriminative low-rank representation of hyperspectral images for classification

S Yang, J Hou, Y Jia, S Mei, Q Du - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In this paper, we propose a novel classification scheme for the remotely sensed
hyperspectral image (HSI), namely SP-DLRR, by comprehensively exploring its unique …

Efficient optimization algorithms for robust principal component analysis and its variants

S Ma, NS Aybat - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Robust principal component analysis (RPCA) has drawn significant attention in the last
decade due to its success in numerous application domains, ranging from bioinformatics …