scientific article

zbMath1208.90211MaRDI QIDQ3067608

Ilvia Gandy, Isao Yamada

Publication date: 21 January 2011

Full work available at URL: http://gcoe-mi.jp/english/./temp/publish/f143657d74f140228f5d7d10d68fa1f7.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithmsPCADouglas-Rachford splittingrank minimizationnuclear norm minimizationsparse error

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Related Items (3)

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset

This page was built for publication: