29 citations · 38 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
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.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)…