Optimal rank-sparsity decomposition
type: Item
instance of: scholarly article
title: Optimal rank-sparsity decomposition
zbMATH Open document ID: 1306.65214
author: Jon Lee
author: Bai Zou
published in: Journal of Global Optimization
publication date: 2015-01-15T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6386997
zbMATH Keywords: global optimization
zbMATH Keywords: rank-sparsity decomposition
zbMATH Keywords: convex relaxation
zbMATH Keywords: branch-and-bound
zbMATH Keywords: numerical examples
zbMATH Keywords: sparse matrix
zbMATH Keywords: low-rank matrix
zbMATH Keywords: heuristic techniques
MaRDI profile type: Publication
full work available at URL: s10898-013-0128-0
OpenAlex ID: W2015523619
cites work: Rank-Sparsity Incoherence for Matrix Decomposition
cites work: A polyhedral study of the cardinality constrained knapsack problem
cites work: Q5405230
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Maximum-entropy remote sampling
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Nonlinear Integer Programming
cites work: Q649984
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
DOI: 10.1007/S10898-013-0128-0
description: scientific article; zbMATH DE number 6386997