84 citations · 88 across the 9 of their papers we have counts for
11 papers
Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation
Guillaume Sagnol, Luc Pronzato
The problems of Lasso regression and optimal design of experiments share a critical property: their optimal solutions are typically \emph{sparse}, i.e., only a small fraction of th…
Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing
Guillaume Sagnol
We study the Min-Weighted Sum Bin Packing problem, a variant of the classical Bin Packing problem in which items have a weight, and each item induces a cost equal to its weight mul…
Surgery Scheduling in Flexible Operating Rooms by using a Convex Surrogate Model of Second-Stage Costs
Mohammed Majthoub Almoghrabi, Guillaume Sagnol
We study the elective surgery planning problem in a hospital with operation rooms shared by elective and emergency patients. This problem can be split in two distinct phases. First…
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt +1
We study kill-and-restart and preemptive strategies for the fundamental scheduling problem of minimizing the sum of weighted completion times on a single machine in the non-clairvo…
Restricted Adaptivity in Stochastic Scheduling
Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt
We consider the stochastic scheduling problem of minimizing the expected makespan on parallel identical machines. While the (adaptive) list scheduling policy achieves an approx…
Stochastic Extensible Bin Packing
Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt
We consider the stochastic extensible bin packing problem (SEBP) in which items of stochastic size are packed into bins of unit capacity. In contrast to the classical bin p…
An unexpected connection between Bayes optimal designs and the Group Lasso
Guillaume Sagnol, Edouard Pauwels
We show that the -optimal design optimization problem over design points in is equivalent to minimizing a quadratic function plus a group lasso sparsity induc…
Computing exact -optimal designs by mixed integer second-order cone programming
Guillaume Sagnol, Radoslav Harman
Let the design of an experiment be represented by an -dimensional vector of weights with nonnegative components. Let the quality of for the estimatio…
Approximation of a Maximum-Submodular-Coverage problem involving spectral functions, with application to Experimental Design
Guillaume Sagnol
We study a family of combinatorial optimization problems defined by a parameter , which involves spectral functions applied to positive semidefinite matrices, and has so…
Computing Optimal Designs of multiresponse Experiments reduces to Second-Order Cone Programming
Guillaume Sagnol
Elfving's Theorem is a major result in the theory of optimal experimental design, which gives a geometrical characterization of optimality. In this paper, we extend this theore…
A Class of Semidefinite Programs with rank-one solutions
Guillaume Sagnol
We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most , where is the rank of the matrix involved in th…