University of Cambridge > > Isaac Newton Institute Seminar Series > Sparse Recovery by l0 Penalty

Sparse Recovery by l0 Penalty

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

VMVW02 - Generative models, parameter learning and sparsity

Sparsity is one of the powerful tools for signal recovery, and has achieved great success in many practical applications. Conventionally this is realized numerically by imposing an l1 penalty, which is the convex relaxation of the l0 penalty. In this talk, I will discuss our recent efforts in the efficient numerical solution of the l0 problem. I will describe a primal dual active set algorithm, and present some numerical results to illustrate its convergence. This talk is based on joint work with Dr. Yuling Jiao and Dr. Xiliang Lu.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity