Optimal rank-sparsity decomposition

DOI10.1007/s10898-013-0128-0zbMath1306.65214OpenAlexW2015523619MaRDI QIDQ486401

Bai Zou, Jon Lee

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 examplesbranch-and-boundsparse matrixconvex relaxationlow-rank matrixheuristic techniquesrank-sparsity decomposition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

On conic QPCCs, conic QCQPs and completely positive programs ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ A novel representation of rank constraints for real matrices

Cites Work

• Unnamed Item
• 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
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• A polyhedral study of the cardinality constrained knapsack problem
• 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
• Rank-Sparsity Incoherence for Matrix Decomposition
• Nonlinear Integer Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Maximum-entropy remote sampling

This page was built for publication: Optimal rank-sparsity decomposition