Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition

DOI10.1109/TSP.2012.2208955MaRDI QIDQ4574116zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574116)