Relaxation methods for strictly convex regularizations of piecewise linear programs (Q1273445)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Relaxation methods for strictly convex regularizations of piecewise linear programs |
scientific article |
Statements
Relaxation methods for strictly convex regularizations of piecewise linear programs (English)
0 references
17 August 1999
0 references
The authors 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 matrix maximization, quadratic programming, and network flows. In particular, it may solve exact penalty versions of such (possible inconsistent) problems, and subproblems of bundle methods for nondifferentiable optimization. It is simple, can exploit sparsity, and in certain cases it is highly parallelizable. Its global convergence is established in the recent framework of B-functions (generalized Bregman functions).
0 references
piecewise linear programs
0 references
convex programming
0 references
nondifferentiable optimization
0 references
relaxation methods
0 references
dual coordinate ascent
0 references
generalized Bregman functions
0 references
algorithm
0 references
entropy matrix maximization
0 references
quadratic programming
0 references
network flows
0 references
global convergence
0 references