Low-rank matrix approximations appear in a wide range of applications: signal and image processing, systems and control theory, symbolic-numeric computations, etc. In many cases, the matrices are structured (for example, Hankel/Toeplitz, block-Hankel, Sylvester, quasi-Hankel), and a low-rank approximation preserving the matrix structure is desirable. This problem is known as structured low-rank approximation, or SLRA.
The two-day workshop will feature invited talks by renowned experts in SLRA and related topics, including development of efficient algorithmic approaches to deal with these difficult nonconvex problems, analysis of their convergence and theoretical guarantees, convex relaxations of SLRA, applications of SLRA and relations to other techniques like tensor decompositions.
Participation in the event is free of charge and open to everyone, subject to mandatory registration.
June 1-2, 2015
GIPSA-lab, 11 rue des Mathématiques, Grenoble Campus BP46, F-38402 SAINT MARTIN D'HERES CEDEX, France.
slra2015 ∂ gipsa-lab ⊙ fr
Registration to the workshop is mandatory due to limited number participants. Please fill in the registration form.