Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss

DOI10.1007/s10898-017-0573-2zbMath1411.90267OpenAlexW2762824495MaRDI QIDQ683720

Shujun Bi, Le Han

Publication date: 9 February 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0573-2

zbMATH Keywords

convex relaxationsparsitylocally Lipschitz surrogateslow-rang

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Related Items

An inexact splitting method for the subspace segmentation from incomplete and noisy observations, Robust tensor recovery with nonconvex and nonsmooth regularization

Uses Software

• RASL

Cites Work

• Unnamed Item
• Latent variable graphical model selection via convex optimization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
• A rank-corrected procedure for matrix completion with fixed basis coefficients
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
• Some sharp performance bounds for least squares regression with \(L_1\) regularization
• TILT: transform invariant low-rank textures
• Two proposals for robust PCA using semidefinite programming
• Efficient algorithms for robust and stable principal component pursuit problems
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
• Nonlocal Sparse and Low-Rank Regularization for Optical Flow Estimation
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Robust Matrix Decomposition With Sparse Corruptions
• Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint
• Convex Analysis
• Median filtering‐based methods for static background extraction from surveillance video