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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Sparse Recovery by l0 Penalty

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hybrid: in-person in Cambridge & online via Teams English Faculty Building GR04 Average on Saturdays: 7573.27027027 kWh

Other talks

Title to be confirmed The rise of local cartography in Europe, 12th-14th century In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Title to be confirmed Title to be confirmed Group Work
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity