An inexact splitting method for the subspace segmentation from incomplete and noisy observations

DOI10.1007/s10898-018-0684-4zbMath1411.65083OpenAlexW2811406593WikidataQ129565718 ScholiaQ129565718MaRDI QIDQ2633544

Renli Liang, Yan-Qin Bai, Hai-Xiang Lin

Publication date: 9 May 2019

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

Full work available at URL: http://resolver.tudelft.nl/uuid:4d9dd287-0744-43ad-a7aa-ca31046194c0

zbMATH Keywords

low rank representationsubspace segmentationinexact augmented Lagrange multiplier method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (1)

A splitting method for the locality regularized semi-supervised subspace clustering

Cites Work

• A fast tri-factorization method for low-rank matrix recovery and completion
• Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
• Nearest \(q\)-flat to \(m\) points
• \(k\)-plane clustering
• Hybrid linear modeling via local best-fit flats
• Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
• Subspace system identification for training-based MIMO channel estimation
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• A Singular Value Thresholding Algorithm for Matrix Completion
• A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
• Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
• Decoding by Linear Programming
• A splitting method for separable convex programming
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

This page was built for publication: An inexact splitting method for the subspace segmentation from incomplete and noisy observations