Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem

DOI10.1007/s40305-015-0089-8zbMath1327.90206OpenAlexW1198001218MaRDI QIDQ888314

Xiao-Lan Liu, Le Han

Publication date: 30 October 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0089-8

zbMATH Keywords

error boundconvex relaxationsimultaneous low-rank and sparse recovery

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (1)

Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Fast global convergence of gradient methods for high-dimensional statistical recovery
• Sparse and low-rank covariance matrix estimation
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Provable Subspace Clustering: When LRR Meets SSC
• A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices
• Proximité et dualité dans un espace hilbertien

This page was built for publication: Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem