Foundations of Distributed and Large Scale Computing Optimization


  • Emilie CHOUZENOUX, Inria Saclay, CVN
  • Jean-Baptiste FEST, Inria Saclay, CVN


    In a wide range of application fields (inverse problems, machine learning, computer vision, data analysis, networking,...), large scale optimization problems need to be solved.

    The objective of this course is to introduce the theoretical background which makes it possible to develop efficient algorithms to successfully address these problems by taking advantage of modern multicore or distributed computing architectures. This course will be mainly focused on nonlinear optimization tools for dealing with convex problems. Proximal tools, splitting techniques and Majorization-Minimization strategies which are now very popular for processing massive datasets will be presented. Illustrations of these methods on various applicative examples will be provided.

    Course outline

    The course consists of eight sessions (3h each) combining lectures and exercices. The following concepts will be presented:

    1. Background on convex analysis

    [Slides (1st part)] [Slides (2nd part)] [Slides (3rd part)] [Slides (4th part)] [Video 1 ] [Video 2 ]

    TP subject: Convex optimization applied to image denoising. [Subject] [Image] [Video-TD ] [Video-TP ]

    2. Parallel and distributed proximal splitting methods

    [Slides (1st part)] [Slides (2nd part)] [Video ]

    TP subject 1: Proximal minimization methods for spectroscopy.
    [Subject (Part I)] [Subject (Part II)] [Signal] [Video ]

    TP subject 2: Primal-dual techniques for database request optimization.
    [Subject] [Code]

    3. Parallelization through Majorization-Minimization approaches

    [Slides] [Video ]

    TP subject: Parallel MM algorithms for tomography image reconstruction.

  • Useful informations

    - Emilie Chouzenoux -

    Retour à la page précédente