skip to content
 

Alternating proximal gradient descent for nonconvex regularised problems with multiconvex coupling terms

Presented by: 
Mila Nikolova CNRS (Centre national de la recherche scientifique), ENS de Cachan
Date: 
Friday 8th September 2017 - 09:00 to 09:50
Venue: 
INI Seminar Room 1
Abstract: 
Co-author: Pauline Tan

There has been an increasing interest in constrained nonconvex  regularized block multiconvex optimization problems. We introduce an  approach that effectively exploits the multiconvex structure of the coupling term and enables complex application-dependent regularization terms to be used. The proposed Alternating Structure-Adapted Proximal gradient descent algorithm enjoys simple well defined updates. Global convergence of the algorithm to a critical point is proved using the so-called Kurdyka-Lojasiewicz  property. What is more, we prove that a large class of useful objective functions obeying our assumptions are subanalytic and thus satisfy the Kurdyka-Lojasiewicz property. Finally, present an application of the algorithm to big-data air-born sequences of images.



The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons