Seminars
Thursday Jun 15, 2023
Location: ESAT Aula C, 14h00-17h00
Understanding Multimodal and Self-Supervised Representation Learning: A Nonlinear Mixture Identification Perspective – Xiao Fu (visiting UMons and KU Leuven, Oregon State Univ.)
Triangle-Motif Based Dense Subgraph Discovery: Algorithms and Applications – Aritra Konar (KU Leuven)
Overdetermined Systems of Polynomial Equations: Tensor-Based Solution and Application – Raphaël Widdershoven (KU Leuven)
Tuesday Mar 21, 2023
Location: ESAT B00.35, 14h00-16h00
Multigrid Proximal Gradient Method for Non-Smooth Convex Optimization – Andersen Ang (visiting UMons, Univ. Southampton)
Infeasible landing algorithm for optimization with orthogonal constraints – Simon Vary (UCLouvain)
Multilinear singular value decomposition of a tensor with fibers observed along one mode – Stijn Hendrikx (KU Leuven)
Tuesday Nov 15, 2022
Location: ESAT Aula L, 14h00-16h00
Comparative study between deep reinforcement learning (DRL) and numerical optimization to discover faster matrix multiplication algorithms – Charlotte Vermeylen (KU Leuven)
Block row Kronecker-structured linear systems with a low multilinear rank tensor solution – Stijn Hendrikx (KU Leuven)
Apocalypse-free first-order low-rank optimization algorithms – Guillaume Olikier (UCLouvain)
Monday May 9, 2022
Location: B91.300 ESAT, 16h00-17h30
Automatic Performance Estimation for Decentralized Optimization – Sébastien Colla (UCLouvain)
On best low rank approximation of positive definite tensors – Eric Evert (KU Leuven)
Monday December 20, 2021
Location: Online, 14h00-14h45
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems – Puya Latafat (KU Leuven)
Wednesday October 13, 2021
Location: B91.100 ESAT, 15h00-16h30
Bounded Simplex-Structured Matrix Factorization – Olivier Vu Thanh (UMons)
Tensor-Based Multivariate Polynomial Optimization: From Tensor Decompositions to Multilinear Optimization – Muzaffer Ayvaz (KU Leuven)
(Lr, Lr, 1)-decompositions, sparse component analysis, and the blind source separation problem – Nithin Govindarajan (KU Leuven)
Friday July 2, 2021
Location: Online, 14h00-16h30
Computing lower bounds on the nonnegative rank using a nested polytopes formulation – Julien Dewez (UCLouvain)
Lasry-Lions envelopes and nonconvex optimization: a homotopy approach – Miguel Simões (KU Leuven)
Existence of best low rank tensor approximations – Eric Evert (KU Leuven)
Tuesday June 15, 2021
Location: Online, 14h00-16h30
On the Sufficiently Scattered Conditions – Timothy Marrinan (UMons)
On the continuity of the tangent cone to the determinantal variety – Guillaume Olikier (UCLouvain)
Compressed sensing of low-rank plus sparse matrices – Simon Vary (UCLouvain)
Monday November 23, 2020
Location: Online, 14h00-14h30
Data-driven interpolation
Ivan Markovsky (VUB)
Monday November 9, 2020
Location: Online, 14h00-14h30
Nonnegative Unimodal Matrix Factorization
Man Shun (Andersen) Ang – UMons
Friday February 14, 2020
Location: ESAT B91.200, 14h00-16h00
Part I: Focusing on models, touching on algorithms
François Moutier: Introduction
Cécile Hautecoeur: Nonnegative Matrix factorization over continuous signals: challenges and applications
Masoud Ahookhosh: Orthogonal nonnegative matrix factorization via multi-block Bregman proximal alternating linearized minimization
Part II: Focusing on algorithms, touching on models
Michiel Vandecappelle: Beta-divergence cost function for nonnegative CPD
Hien Le: Kullback-Leibler Nonnegative Matrix Factorization: a non-typical non-convex composite optimization problem
Andersen Ang: Extrapolation of block coordinate descent methods for fast nonnegative CPD
Monday November 25, 2019
Location: ESAT 01.57, 16h00-17h00
Nonlinear Preconditioning for Nonlinear Optimization: Accelerating Alternating Least Squares for Canonical Tensor Decomposition
Hans De Sterck (Department of Applied Mathematics, University of Waterloo, Canada)
Some geometric and machine learning methods for model order reduction
Rolando Mosquera and Antoine Falaize (Laboratoire des Sciences de l’Ingnieur pour l’Environnement (LaSIE), Université de la Rochelle, France)
Monday October 28, 2019
Location: ESAT B91.100, 14h00-15h30
Low-rank plus sparse matrices: Ill-posedness and recovery
Simon Vary (Mathematical Institute, University of Oxford)Deterministic bounds for the existence of best rank R tensor approximations
Eric Evert (KU Leuven)
Monday July 1, 2019
Location: ESAT 01.57, 13h00-14h30
An optimal rank Grassmann minimal enclosing ball
Tim Marrinan (COLORAMAP Group, University of Mons, Belgium)Canonical polyadic decomposition with general cost functions using generalized Gauss-Newton
Michiel Vandecappelle (KU Leuven)
Friday May 10, 2019
Location: ESAT B00.35, 13h00-14h45
The endpoint geodesic problem on the Grassmann manifold
Thomas Bendokat (University of Southern Denmark)Identifiability of sparse low-rank matrix factorizations
Nicolas Gillis (UMons)Data-driven simulation using the nuclear norm heuristic
Philippe Dreesen and Ivan Markovsky (VUB)
Friday April 26, 2019
Location: 01.57 ESAT, KU Leuven – 15h00 – 16h45
A universal majorization-minimization framework for the convergence analysis of nonconvex proximal algorithms – Andreas Themelis (KULeuven)
Generic uniqueness of a structured matrix factorization – Ignat Domanov (KULeuven)
Multi-parameter Eigenvalue Problems in Systems and Control –Christof Vermeersch (KULeuven)
Friday March 22, 2019
Location: 01.57 ESAT, KU Leuven – 13h00 – 14h30Inertial Block Mirror Descent Method for Non-Convex Non-Smooth Optimization – Le Thi Khanh Hien (UMons), Nicolas Gillis (UMons) and Panagiotis Patrinos (KU Leuven)
Nonnegative matrix factorization with polynomial signals via hierarchical alternating least squares – Cécile Hautecoeur (UCL)
Monday February 25, 2019
Location: B00.35 ESAT, KU Leuven – 12h00 – 13h30
How to tackle large-scale blind source separation? – The convolutive case – Martijn Boussé (KU Leuven)
Numerical computation for orthogonal low rank approximation of tensors – Guan Yu (UCL)
Wednesday November 28, 2018
Location: 91.100 ESAT, KU Leuven – 16h15 – 17h45Role modeling using a low-rank similarity matrix – Paul Van Dooren (Universite Catholique de Louvain)
Optimization Algorithms for 3D Medical Image Registration using Numerical Tensor Methods – Justin Buhendwa Ny. and Annick Sartenaer (University of Namur)
Monday November 5, 2018
Location: B00.35 ESAT, KU Leuven – 14h00 – 15h30Computation of tensor decompositions via structured null spaces – Nico Vervliet (KU Leuven)
Parametric model order reduction and interpolation on matrix manifolds as a tool – Nguyen Thanh Son (UCL)
Wednesday October 3, 2018
Location: B00.35 ESAT, KU Leuven – 16h00 – 17h30What is happening in non-negative matrix factorization: models and
algorithms – Man Shun Ang (UMons)Data-driven simulation using the nuclear norm heuristic – Philippe Dreesen & Ivan Markovsky (VUB)
Friday June 22, 2018
Location: B00.35 ESAT KU LEuven – 14h30 – 15h30
Relative smoothness condition and its application to third order methods – Yu. Nesterov (CORE/INMA, UCL, Belgium)
Friday May 18, 2018
Location: 01.60 ESAT KU Leuven – 14h30 – 15h45
Data-driven modeling in linear dynamic networks – Paul M.J. Van den Hof (Department of Electrical Engineering, Eindhoven University of Technology)
Fast matrix multiplication. Equivalence between algorithms – Guillaume Berger (UCL)
Wednesday April 18, 2018
Location: 01.57 ESAT KU Leuven – 15h00 – 16h00
Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization – Konstantin Usevich (GIPSA-Lab, CNRS and Univ. Grenoble Alpes, France)
Dynamic measurement: a recursive structured total least squares problem – Ivan Markovsky (VUB)
Friday March 30, 2018
Location: B00.35 ESAT KU Leuven – 14h00 – 15h00
Variable projection applied to block term decomposition of higher-order tensors – Guillaume Olikier (UCL)
Nonlinear Least Squares Updating of the Canonical Polyadic Decomposition – Michiel Vandecappelle (KU Leuven, Campus Kulak Kortrijk)