Sophie Huiberts

MaRDI QIDQ2061904zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An unconditional lower bound for the active-set method in convex quadratic maximization	2026-07-13	Paper
Asymptotic bounds on the combinatorial diameter of random polytopes Discrete & Computational Geometry	2026-07-02	Paper
Upper and lower bounds on the smoothed complexity of the simplex method TheoretiCS	2025-10-22	Paper
A nearly optimal randomized algorithm for explorable heap selection Mathematical Programming. Series A. Series B	2025-03-05	Paper
An unconditional lower bound for the active-set method in convex quadratic maximization (available as arXiv preprint)	2025-01-01	Paper
A simple method for convex optimization in the oracle model Mathematical Programming. Series A. Series B	2024-08-20	Paper
Upper and lower bounds on the smoothed complexity of the simplex method	2024-05-08	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix Mathematical Programming. Series A. Series B	2024-02-21	Paper
A nearly optimal randomized algorithm for explorable heap selection Integer Programming and Combinatorial Optimization	2023-11-09	Paper
On the integrality gap of binary integer programs with Gaussian data Mathematical Programming. Series A. Series B	2023-03-14	Paper
A simple method for convex optimization in the oracle model (available as arXiv preprint)	2022-08-16	Paper
Smoothed Analysis of the Simplex Method	2022-02-04	Paper
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes	2021-12-24	Paper
On the integrality gap of binary integer programs with Gaussian data Integer Programming and Combinatorial Optimization	2021-12-21	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper
A friendly smoothed analysis of the simplex method SIAM Journal on Computing	2020-10-26	Paper
A friendly smoothed analysis of the simplex method Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper

Research outcomes over time

This page was built for person: Sophie Huiberts