1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LG2026
Finding Stationary Points by Comparisons
Helin Wang, Chenyi Zhang, Xiwen Tao +2
We study the problem of finding stationary points of non-convex functions when access to the objective is provided only through a comparison oracle that, given two points, outputs…
cs.LG2026★ 1 cited
Gradient Testing and Estimation by Comparisons
Xiwen Tao, Chenyi Zhang, Helin Wang +2
We study gradient testing and gradient estimation of smooth functions using only a comparison oracle that, given two points, indicates which one has the larger function value. For…
cs.DS2026
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
Yuexin Su, Chenyi Zhang, Peiyuan Huang +2
Computing approximate Karush--Kuhn--Tucker (KKT) points for constrained nonconvex programs is a fundamental problem in mathematical programming. Interior-point trust-region (IPTR)…