A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621)
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: A subgradient selection method for minimizing convex functions subject to linear constraints |
scientific article; zbMATH DE number 4020362
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subgradient selection method for minimizing convex functions subject to linear constraints |
scientific article; zbMATH DE number 4020362 |
Statements
A subgradient selection method for minimizing convex functions subject to linear constraints (English)
0 references
1987
0 references
A readily implementable subgradient algorithm is given for minimizing a convex, but not necessarily differentiable, function f subject to a finite number of linear constraints. It is shown that the algorithm converges to a solution, if any. The convergence is finite if f is piecewise linear.
0 references
nondifferentiable optimization
0 references
linearly constrained optimization
0 references
convex programming
0 references
subgradient algorithm
0 references
convergence
0 references
0 references
