A limiting analysis on regularization of singular sdp and its implication to infeasible interior-point algorithms
HIGHLIGHTS SUMMARY Strong feasibility of primal and dual problems is a standard regularity condition in convex optimization, e_g_[24], Due to […]