Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming

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…