5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.OC2023
Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
Zheng Qu, Tianyou Zeng, Yuchen Lou
We consider the problem of maximizing a convex quadratic function over a bounded polyhedral set. We design a new framework based on SDP relaxations and cutting plane methods for so…
math.OC2021★ 5 cited
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization
HanQin Cai, Yuchen Lou, Daniel McKenzie +1
We consider the zeroth-order optimization problem in the huge-scale setting, where the dimension of the problem is so large that performing even basic vector operations on the deci…