TY - JOUR A1 - Sagnol, Guillaume A1 - Pauwels, Edouard T1 - An unexpected connection between Bayes A-optimal designs and the group lasso T2 - Statistical Papers N2 - We show that the A-optimal design optimization problem over m design points in R^n is equivalent to minimizing a quadratic function plus a group lasso sparsity inducing term over n x m real matrices. This observation allows to describe several new algorithms for A-optimal design based on splitting and block coordinate decomposition. These techniques are well known and proved powerful to treat large scale problems in machine learning and signal processing communities. The proposed algorithms come with rigorous convergence guarantees and convergence rate estimate stemming from the optimization literature. Performances are illustrated on synthetic benchmarks and compared to existing methods for solving the optimal design problem. Y1 - 2019 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/7305 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-73059 VL - 60 IS - 2 SP - 215 EP - 234 ER -