Optimal rank-sparsity decomposition
DOI10.1007/S10898-013-0128-0zbMATH Open1306.65214OpenAlexW2015523619MaRDI QIDQ486401FDOQ486401
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0128-0
Recommendations
- Rank-Sparsity Incoherence for Matrix Decomposition
- Simultaneous pursuit of sparseness and rank structures for matrix decomposition
- scientific article; zbMATH DE number 6142618
- A multi-objective memetic algorithm for low rank and sparse matrix decomposition
- Penalty decomposition methods for rank minimization
global optimizationnumerical examplessparse matrixconvex relaxationbranch-and-boundlow-rank matrixheuristic techniquesrank-sparsity decomposition
Numerical mathematical programming methods (65K05) Computational methods for sparse matrices (65F50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Rank-Sparsity Incoherence for Matrix Decomposition
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Title not available (Why is that?)
- Nonlinear integer programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- A polyhedral study of the cardinality constrained knapsack problem
- Maximum-entropy remote sampling
Cited In (8)
- On conic QPCCs, conic QCQPs and completely positive programs
- A novel representation of rank constraints for real matrices
- Rank related properties for basis pursuit and total variation regularization
- Rank-Sparsity Incoherence for Matrix Decomposition
- Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
- Rank-based decompositions of morphological templates
- Penalty decomposition methods for rank minimization
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
This page was built for publication: Optimal rank-sparsity decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486401)
