Principal Component Pursuit Matrix Optimization Problem

2 次查看(过去 30 天)
Hi all
How can I solve this problem
let say A is any matrix
then minimize |L|+lambda||S|| subject to L+S=A.
where L is a low rank matric and S is a sparse matrix..The superposition of L and S gives the original matrice A
  1 个评论
Matt J
Matt J 2014-1-15
编辑:Matt J 2014-1-15
What does the || operator signify? Absolute value? Frobenius or some other norm? Determinant?
Also, what are the unknowns? All elements of L and S? If all matrix elements can be chosen freely (apart from the constraint L+S=A), what is to ensure that L will be low rank and what is to ensure that S will be sparse?

请先登录,再进行评论。

回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Multiobjective Optimization 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by