22 citations · 45 across the 6 of their papers we have counts for
7 papers
Fast SDP certification of neural networks : towards large multi-class datasets
Margot Boyer, Clément Rambour, Zacharie Alès +1
We present a new quadratic model for the certification problem in adversarial robustness, which simultaneously accounts for all possible target classes. Building on this model, we…
A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem
Amélie Lambert
In this paper, we consider the optimal power flow (OPF) problem which consists in determining the power production at each bus of an electric network by minimizing the production c…
Valid inequalities and global solution algorithm for Quadratically Constrained Quadratic Programs
Amélie Lambert
We consider the exact solution of problem that consists in minimizing a quadratic function subject to quadratic constraints. Starting from the classical convex relaxation th…
Mixing convex-optimization bounds for maximum-entropy sampling
Zhongzhu Chen, Marcia Fampa, Amélie Lambert +1
The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determin…
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization
Hadrien Godard, Sourour Elloumi, Amélie Lambert +2
Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specia…
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Sourour Elloumi, Amélie Lambert, Arnaud Lazare
We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Refo…