'Etienne Objois

collaborators

2 papers

quant-ph2025

Adaptive Sparsification for Linear Programming

Ãtienne Objois, Adrian Vladu

We introduce a generic framework for solving linear programs (LPs) with many constraints $(n ≫ d)$ via adaptive sparsification. Our approach provides a principled generalization…

cs.DS2025

Approximating $q \to p$ Norms of Non-Negative Matrices in Nearly-Linear Time

Ãtienne Objois, Adrian Vladu

We provide the first nearly-linear time algorithm for approximating $ℓ_{q \to p}$ -norms of non-negative matrices, for $q \geq p \geq 1$ . Our algorithm returns a $(1-\var…

Adaptive Sparsification for Linear Programming

Approximating q→p Norms of Non-Negative Matrices in Nearly-Linear Time

Approximating $q \to p$ Norms of Non-Negative Matrices in Nearly-Linear Time