Relaxation Methods for Strictly Convex Regulariztions of Piecewise Linear Programs

摘要

We give an algorithm for minimizing the sum of a strictly convex function and a convex piecewise linear function. It extends several dual coordinate ascent methods for large-scale linearly constrained problems that occur in entropy maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possibly inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. it is simple, can exploit sparsity, and in certain cases is highly parallelizable. Its global convergence is established in the recent framework of B-functions (generalized Bregman functions).