216 citations · 1k across the 31 of their papers we have counts for
5 papers · 1 filter
Extended Formulations for Order Polytopes through Network Flows
Clintin P. Davis-Stober, Jean-Paul Doignon, Samuel Fiorini +2
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models,…
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
Etienne de Klerk, Francois Glineur, Adrien Taylor
We provide new tools for worst-case performance analysis of the gradient (or steepest descent) method of Cauchy for smooth strongly convex functions, and Newton's method for self-c…
Algorithms for Positive Semidefinite Factorization
Arnaud Vandaele, François Glineur, Nicolas Gillis
This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an -by- nonnega…
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
Adrien B. Taylor, Julien M. Hendrickx, François Glineur
We study the worst-case convergence rates of the proximal gradient method for minimizing the sum of a smooth strongly convex function and a non-smooth convex function whose proxima…
A robust convex optimization framework for autonomous network planning under load uncertainty
Benoît Martin, François Glineur, Emmanuel De Jaeger
Autonomous microgrid planning is a Mixed-Integer Non Convex decision problem that requires to consider investments in both distribution and generation capacity and represents signi…