tag:blogger.com,1999:blog-6141980.post6589826452953069387..comments2024-03-20T12:28:35.004-05:00Comments on Nuit Blanche: Around the blogs in 80 hoursIgorhttp://www.blogger.com/profile/17474880327699002140noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-6141980.post-45698717167110545702012-03-20T11:40:19.828-05:002012-03-20T11:40:19.828-05:00Hi igor,
This comment is related to the question a...Hi igor,<br />This comment is related to the question above.<br />I remenber reading on your blog, about analysis sparsity. I hope this problem can be solved in a similar manner. <br />Objective function is to minimize b-Px l2 norm and the sparsity constraint is to be imposed on Ax. If the matrix Ax is having a sparse structure (can minimize nuclear norm), then you might solve the optimization problem:<br />minimize ||Ax||_nuclear subject to ||y-Px||_2<eps<br /> <br />or If the matrix Ax happens to be close to diagonal and has a sparse diagonal, then you cam minimize ||diag(Ax)||_1 in the place of nuclear norm also.Anonymousnoreply@blogger.com