Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition

DOI10.1109/TSP.2012.2208955zbMath1393.94190OpenAlexW2031993275MaRDI QIDQ4574116

Rick Chartrand

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2012.2208955

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (19)

Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems ⋮ Bounding duality gap for separable problems with linear constraints ⋮ An alternating minimization method for matrix completion problems ⋮ A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ Non-convex fractional-order derivative for single image blind restoration ⋮ Matrix completion for matrices with low-rank displacement ⋮ Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery ⋮ Multi-stage convex relaxation method for low-rank and sparse matrix separation problem ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ An efficient nonconvex regularization for wavelet frame and total variation based image restoration ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ Non-Convex and Convex Coupling Image Segmentation via TGpV Regularization and Thresholding ⋮ Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ A simple effective heuristic for embedded mixed-integer quadratic programming ⋮ The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM

This page was built for publication: Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition