Solving Non-smooth Constrained Programs with Lower Complexity than O(1/ ): A Primal-Dual Homotopy Smoothing Approach

Abstract

We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is O(^-1). In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of O(^-2/(2+)_2(^-1)), where (0,1] is a local error bound parameter. As an example application, we show that the distributed geometric median problem, which can be formulated as a constrained convex program, has its dual function non-smooth but satisfying the aforementioned local error bound condition with =1/2, therefore enjoying a convergence time of O(^-4/5_2(^-1)). This result improves upon the O(^-1) convergence time bound achieved by existing distributed optimization algorithms. Simulation experiments also demonstrate the performance of our proposed algorithm.

Tasks

Reproductions