Français Anglais
Accueil Annuaire Plan du site
Accueil > News du laboratoire > SÉMINAIRE DIGITEO, séance du 9/11
SÉMINAIRE DIGITEO, séance du 9/11
SÉMINAIRE DIGITEO, séance du 9/11 SÉMINAIRE DIGITEO, séance du 9/11
11 septembre 2012

14h30, PUIO, petit amphi
Matrix completions
Monique Laurent, CWI, Amsterdam, and Tilburg University
http://www.digiteo.fr/code_qtyc9qbptu
In this lecture we discuss how to complete a partially specified matrix to a positive semi-definite matrix. This includes questions like deciding existence and constructing a completion, and determining the smallest possible rank of a completion. We present structural results and algorithms that take the graph of specied entries into account. This combinatorial approach leads to links between various areas: cut and metric polytopes in combinatorial op- timization, correlation matrices and distance matrices in distance geometry, Euclidean graph realizations and Colin de Verdiere type geometric graph invariants.


Monique Laurent is leader of the research group Algorithms, 
Combinatorics
and Optimization at CWI in Amsterdam and professor at
the University of Tilburg. She received her PhD degree in Mathematics 
at the University
Paris Diderot in 1986. Before joining CWI in 1997, she has held 
positions at CNET and at CNRS in Paris.
She was also a Humboldt fellow at the University of Bonn in 1991/92 and 
had visiting positions e.g. at Yale University,
IASI-CNR in Rome, and Tokyo Institute of Technology.
 
Her research field is combinatorial optimization with a focus on
algorithmic methods using algebraic tools and semidefinite programming.
She has more than 80 publications and co-authored the book `Geometry of 
Cuts and Metrics'.
She is an editor of Mathematics of Operations Research, SIAM Journal on 
Optimization and SIAM Journal on Discrete
Mathematics. She has been involved in national and international EU 
projects and in the organization of
various scientific events, including workshops and seminars on 
Combinatorial Optimization, Semidefinite Programming, and on Algorithms 
for Real Algebraic Geometry in Oberwolfach, and a thematic semester 
program on Optimization at IPAM in Los Angeles.
 
More information is available at http://www.cwi.nl/~monique
 


Pour en savoir plus: http://www.digiteo.fr/code_qtyc9qbptu
News
George Manoussakis, lauréat 2018, prix de thèse (accessit) Charles Delorme
18 septembre 2018
George Manoussakis, est lauréat de prix de thèse (accessit) Ch. Delorme 2018. Il a soutenu sa thèse au LRI/Galac en Novembre 2017 sous la direction de J. Cohen et A. Deza. Depuis Septembre 2018 il est MdeC à l'Université de Versailles/Li-PaRAD.

TrackML dans Nature
21 janvier 2018
L'apprentissage automatique peut-il aider la physique des hautes énergies à découvrir et à caractériser de nouvelles particules ? TAO participe à l'organisation du challenge TrackML avec le CERN. La seconde phase de la compétition utilisera Codalab.

Un article de Isabelle Guyon sur la démocratisation de l'IA
19 mars 2018
Lien vers l'article paru dans le journal le monde :
http://www.lemonde.fr/acces-restreint/sciences/article/2018/04/08/a4544bd07cad09fe52980c0f82c08b34_5282548_1650684.html