Optimal rank-sparsity decomposition

DOI10.1007/S10898-013-0128-0zbMATH Open1306.65214OpenAlexW2015523619MaRDI QIDQ486401FDOQ486401

Authors Jon Lee, Bai Zou

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

zbMATH Keywords

global optimizationnumerical examplessparse matrixconvex relaxationbranch-and-boundlow-rank matrixheuristic techniquesrank-sparsity decomposition

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 6276219 (Why is no real title available?)
• A polyhedral study of the cardinality constrained knapsack problem
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Maximum-entropy remote sampling
• 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
• Nonlinear integer programming
• Rank-Sparsity Incoherence for Matrix Decomposition

Cited in

(12)

• Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
• Penalty decomposition methods for rank minimization
• Rank related properties for basis pursuit and total variation regularization
• A multi-objective memetic algorithm for low rank and sparse matrix decomposition
• Rank-Sparsity Incoherence for Matrix Decomposition
• Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
• Simultaneous pursuit of sparseness and rank structures for matrix decomposition
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
• A novel representation of rank constraints for real matrices
• On conic QPCCs, conic QCQPs and completely positive programs
• Low-rank/sparse-inverse decomposition via Woodbury
• Rank-based decompositions of morphological templates

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)