2 papers
math.OC2026
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…
math.NA2024
An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems
N. Huang, Y. -H. Dai, D. Orban +1
Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution of saddle-point system…