10 citations · 27 across the 17 of their papers we have counts for
1 paper · 1 filter
Yu-Hong Dai, Ruoyu Diao, Xin-Wei Liu +1
It has long remained open whether smoothing Newton methods (SNMs) for symmetric cone programming (SCP) admit polynomial iteration complexity. A key difficulty lies in the lack of a…