3 citations · 3 across the 2 of their papers we have counts for
3 papers
math.OC2019
Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities
Wei-Kun Chen, Yu-Hong Dai
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhe…
math.OC2019★ 3 cited
Gradient methods exploiting spectral properties
Yakui Huang, Yu-Hong Dai, Xin-Wei Liu +1
We propose a new stepsize for the gradient method. It is shown that this new stepsize will converge to the reciprocal of the largest eigenvalue of the Hessian, when Dai-Yang's asym…
math.OC2016
Barzilai-Borwein Step Size for Stochastic Gradient Descent
Conghui Tan, Shiqian Ma, Yu-Hong Dai +1
One of the major issues in stochastic gradient descent (SGD) methods is how to choose an appropriate step size while running the algorithm. Since the traditional line search techni…