Speaker: 

Professor Stanley Osher

Institution: 

UCLA

Time: 

Thursday, February 18, 2010 - 11:00am

Location: 

RH 306

Bregman iteration has been around since 1967. It turns out to be unreasonably effective for optimization problems involving L1, BV and related penalty terms. This is partly because of a miraculous cancellation of error. We will discuss this and give biomedical imaging applications, related to compressive sensing and Total Variation based restoration.