Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposition method of descent for minimizing the sum of convex nonsmooth functions |
scientific article; zbMATH DE number 3939104
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition method of descent for minimizing the sum of convex nonsmooth functions |
scientific article; zbMATH DE number 3939104 |
Statements
Decomposition method of descent for minimizing the sum of convex nonsmooth functions (English)
0 references
1987
0 references
This paper presents a descent method for minimizing a sum of possibly nonsmooth convex functions. Search directions are found by solving subproblems obtained by replacing all but one of the component functions with their polyhedral approximations and adding a quadratic term. The algorithm is globally convergent and terminates when the objective function happens to be polyhedral. It yields a new decomposition method for solving large-scale linear programs with dual block-angular structure.
0 references
descent method
0 references
sum of possibly nonsmooth convex functions
0 references
decomposition
0 references
large-scale linear programs
0 references
dual block-angular structure
0 references
nondifferentiable optimization
0 references
0 references
