Optimal rank-sparsity decomposition

Jon Lee () and Bai Zou ()

Journal of Global Optimization, 2014, vol. 60, issue 2, 307-315

Abstract: We describe a branch-and-bound (b&b) method aimed at searching for an exact solution of the fundamental problem of decomposing a matrix into the sum of a sparse matrix and a low-rank matrix. Previous heuristic techniques employed convex and nonconvex optimization. We leverage and extend those ideas, within a spatial b&b framework, aimed at exact global optimization. Our work may serve to (i) gather evidence to assess the true quality of the previous heuristic techniques, and (ii) provide software to routinely calculate global optima or at least better solutions for moderate-sized instances coming from applications. Copyright Springer Science+Business Media New York 2014

Keywords: Global optimization; Rank-sparsity decomposition; Convex relaxation; Branch-and-bound; 65K05; 65F50; 90C26 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-013-0128-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:60:y:2014:i:2:p:307-315

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-013-0128-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().