activity
20212025
most citedMemory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Secretary Problems with Random Number of Candidates: How Prior Distributional Information Helps

Junhui Zhang, Patrick Jaillet

We study variants of the secretary problem, where , the number of candidates, is a random variable, and the decision maker wants to maximize the probability of success -- pickin…

math.OC2023★ 3 cited

Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes

Moïse Blanchard, Junhui Zhang, Patrick Jaillet

We propose a family of recursive cutting-plane algorithms to solve feasibility problems with constrained memory, which can also be used for first-order convex optimization. Precise…