Support vector machines with ramp loss ( $$L_r$$ -SVM) have attracted considerable attention due to the robustness of loss. However, corresponding optimization problem is non-convex, and given Karush–Kuhn–Tucker (KKT) conditions are only first-order necessary conditions. To enrich optimality theory -SVM, we first introduce analyze proximal operator for loss, then establish a stronger condition:...