5 citations · 6 across the 3 of their papers we have counts for
3 papers
math.OC2026
Counterexamples for BFGS-type methods under arbitrary strong Wolfe constants
Rui Diao
Whether the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and its variants can fail to converge on smooth nonconvex functions under realistic line-search parameters has remained a…
cs.DS2017★ 5 cited
A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem
Rui Diao, Ya-Feng Liu, Yu-Hong Dai
The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals and a target in…
math.OC2015★ 1 cited
An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions
Ya-Feng Liu, Rui Diao, Feng Ye +1
In this paper, we consider the problem of computing the smallest enclosing ball (SEB) of a set of balls in where the product is large. We first approximate…